Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters.
Constraints:
- 1 <= s.length <= 10^5
- s consists of English letters, digits, symbols and spaces.
Examples:
Input: abcabcbb
Output: 3
Explanation: The answer is "abc", with the length of 3.
Input: bbbbb
Output: 1
Explanation: The answer is "b", with the length of 1.
Input: pwwkew
Output: 3
Explanation: The answer is "wke", with the length of 3.
Solutions
Sliding Window
We use a sliding window approach to solve this problem. We maintain a left pointer and a right pointer, and a map to store the characters we have seen so far and their indices. We move the right pointer to the right and update the map. If we encounter a character that is already in the map, we move the left pointer to the right of the previous occurrence of the character. We keep track of the maximum length of the substring without repeating characters.
def lengthOfLongestSubstring(s:
str) -> int:
left = 0
max_length = 0
char_index_map = {}
for right in range(len(s)):
if s[right] in char_index_map:
left = max(left, char_index_map[s[right]] + 1)
char_index_map[s[right]] = right
max_length = max(max_length, right - left + 1)
return max_lengthFollow-up:
What if we need to find the longest substring with at most k repeating characters?
