They asked me to design an efficient algorithm to find the longest substring without repeating characters, explain its time and space complexity, and then optimize it further if possible — testing both my coding and problem-solving approach.
Check out your Company Bowl for anonymous work chats.