WWorkday·DSASDE-1Technical Phone Screen
Longest Substring Without Repeating Characters
Problem
Find the length of the longest substring without repeating characters (Strings & Hashing).
Example
"abcabcbb" -> 3 ("abc")
Constraints
- 0 ≤ |s| ≤ 5 × 10^4
Approach
Sliding window + last-seen index map. Reported Workday HackerRank-style question.
added 6 days ago