Merge pull request #31 from Rajkushwaha0/New-Question

Longest Substring Without Repeating Characters

Author: kishanrajput23

3-Longest Substring Without Repeating Characters

@@ -0,0 +1,12 @@
+class Solution:
+    def lengthOfLongestSubstring(self, s: str) -> int:
+        l=0
+        res=0
+        charset=set()
+        for r in range(len(s)):
+            while(s[r] in charset):
+                charset.remove(s[l])
+                l+=1  
+            charset.add(s[r])
+            res=max(res,r-l+1)
+        return (res)