Add files via upload

DARKcoder37 · web-flow · commit edb55fe3266a · 2023-04-13T18:11:07.000+05:30
diff --git a/Problem Solution/3) Longest Substring Without Repeating Characters/Longest Substring Without Repeating Characters.txt b/Problem Solution/3) Longest Substring Without Repeating Characters/Longest Substring Without Repeating Characters.txt
@@ -0,0 +1,30 @@
+3. Longest Substring Without Repeating Characters(Medium)
+
+Given a string s, find the length of the longest 
+substring
+ without repeating characters.
+
+ 
+
+Example 1:
+
+Input: s = "abcabcbb"
+Output: 3
+Explanation: The answer is "abc", with the length of 3.
+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 * 104
+s consists of English letters, digits, symbols and spaces.
diff --git a/Problem Solution/3) Longest Substring Without Repeating Characters/sol.py b/Problem Solution/3) Longest Substring Without Repeating Characters/sol.py
@@ -0,0 +1,14 @@
+class Solution:
+  def lengthOfLongestSubstring(self, s: str) -> int:
+    ans = 0
+    count = collections.Counter()
+
+    l = 0
+    for r, c in enumerate(s):
+      count[c] += 1
+      while count[c] > 1:
+        count[s[l]] -= 1
+        l += 1
+      ans = max(ans, r - l + 1)
+
+    return ans
