Added Longest_Substring_Without_Repeating_Characters.py

RatnadeepGhosh · web-flow · commit d78b1b09f577 · 2020-10-02T01:11:36.000+05:30
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.
Example 4:

Input: s = ""
Output: 0
 

Constraints:

0 &lt;= s.length &lt;= 5 * 104
s consists of English letters, digits, symbols and spaces.
diff --git a/Longest_Substring_Without_Repeating_Characters.py b/Longest_Substring_Without_Repeating_Characters.py
@@ -0,0 +1,18 @@
+#https://www.facebook.com/ratnadeep.pragwalit/posts/2791088471172809
+#Subscribed by Ratnadeep Ghosh
+
+s=input()
+m=0
+        
+s1=""
+j=0
+for i in range(len(s)):
+    for j in range(i,len(s)):
+        if s[j] not in s1:
+            s1=s1+s[j]
+        else:
+            break
+    m=max(m,len(s1))  
+    s1=""
+                    
+print(m) 
