leetcode-problems-solution/3_longest_substr_without_repeating_char.cpp at main · mohin-73/leetcode-problems-solution · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#include <bits/stdc++.h>

using namespace std;

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        vector<bool> present(256, false);
        int left = 0, right = 0, maxLen = 0;
        while (right < s.length()) {
            if (!present[s[right]]) {
                present[s[right]] = true;
                ++right;
            } else {
                present[s[left]] = false;
                ++left;
            }
            maxLen = max(maxLen, right - left);
        }
        return maxLen;
    }
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    string s = "abcabcbb";
    Solution solve;
    int result = solve.lengthOfLongestSubstring(s);
    cout << result << '\n';
    return 0;
}

/*
    ------------------
    Problem Statement:
    ------------------

    Given a string s, find the length of the longest substring without duplicate characters.

    ----------
    Example 1:
    ----------

    Input: s = "abcabcbb"
    Output: 3
    Explanation: The answer is "abc", with the length of 3. Note that "bca" and "cab" are also correct answers.

    ----------
    Example 2:
    ----------

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

    ----------
    Example 3:
    ----------

    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.

    ------------
    Constraints:
    ------------

    0 <= s.length <= 5 * 10^4
    s consists of English letters, digits, symbols and spaces.
*/