GitHub

Longest Substring Without Repeating Characters.java

// Time Complexity: O(n²) (due to substring creation and window reset) } else if (right == s.length() - 1 && !(map.containsKey(s.substring(left, right + 1)))) { map ...