Longest Substring Without Repeating Characters Problem

1
2
3
Input: s = "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3.

1
2
3
Input: s = "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.

1
2
3
4
Input: s = "pwwkew"
Output: 3
Explanation: The answer is "wke", with the length of 3.
Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.

1
2
Input: s = ""
Output: 0

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        int len = s.size();
        int max_len = 0;
        unordered_map<char, int> ht;
        
        int i = 0, j = 0;
        for (i = 0; i < len; i ++) {
            while ((ht.find(s[j]) == ht.end()) && (j < len)) {
                ht[s[j]] = 1;
                j ++;
            }      
            
            max_len = max(max_len, j - i);
            ht.erase(s[i]);
        }
        return max_len;
    }
};