UiPath·Software Engineer·Technical Phone Screen
- Given a string, find the length of the longest substring with no repeated characters, where letter casing is ignored (so 'A' and 'a' count as the same). All ASCII characters including whitespace are valid. Explain your algorithm's time and space complexity, cover edge cases like empty strings or all-duplicate inputs, and describe how you'd handle Unicode. Then, for inputs too large to fit in memory, walk through a streaming approach and its trade-offs.
“Sliding window with a set, got that part out pretty quickly.”