String & SubString

Question 1

Longest substring without repeating character

Answer 1

1. two pointer with one pass
2. Store the i pointer with j + 1
3. If map contains, get the i = max(i, get())
4. Always calculate maxLength = max(maxL, j - i + 1) // + 1coz every char is substring with len 1