##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
LeetCode #3: Longest Substring Without Repeating Characters
You're given a string. Find the length of the longest substring without repeating characters.
Example: s = "abcabcbb" returns 3 ("abc").
Example: s = "bbbbb" returns 1 ("b").
Constraints: String length up to 5×104.
Try solving it before reading the hints.
