Tff

gistfile1.txt

#include <iostream>
#include <string>
#include <unordered_map>

using namespace std; // Add this line

int lengthOfLongestSubstring(string s) {
    int n = s.length();
    int maxLength = 0;
    unordered_map<char, int> charIndexMap;
    int left = 0;

    for (int right = 0; right < n; right++) {
        if (charIndexMap.find(s[right]) != charIndexMap.end()) {
            // Update the left boundary of the window to skip the repeated character
            left = max(left, charIndexMap[s[right]] + 1);
        }
        charIndexMap[s[right]] = right; // Store the index of the character

        // Update the maximum length if needed
        maxLength = max(maxLength, right - left + 1);
    }

    return maxLength;
}

int main() {
    string input = "abcabcbb";
    int result = lengthOfLongestSubstring(input);
    cout << "Longest substring without repeating characters: " << result << endl;
    return 0;
}