leetcode

3. Longest Substring Without Repeating Characters

Solution

• Java code
• Python code

Time complexity: O(n)

k =

alphabet

= 128

Space complexity: O(k)