From 822025d64bf91ec7077d93056729672976173d86 Mon Sep 17 00:00:00 2001
From: Raj kushwaha <87632065+Rajkushwaha0@users.noreply.github.com>
Date: Tue, 18 Oct 2022 09:25:53 +0530
Subject: [PATCH] Longest Substring Without Repeating Characters

---
 3-Longest Substring Without Repeating Characters | 12 ++++++++++++
 1 file changed, 12 insertions(+)
 create mode 100644 3-Longest Substring Without Repeating Characters

diff --git a/3-Longest Substring Without Repeating Characters b/3-Longest Substring Without Repeating Characters
new file mode 100644
index 0000000..65a07b0
--- /dev/null
+++ b/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)