add new case

AldythNahak · AldythNahak · commit 72f7f0946940 · 2025-05-16T13:51:08.000+07:00
diff --git a/Easy/valid_parentheses.py b/Easy/valid_parentheses.py
@@ -0,0 +1,39 @@
+class Solution(object):
+  def isValid(self, s):
+    """
+    :type s: str
+    :rtype: bool
+    """
+    mapParentheses = {"(": ")","[": "]", "{": "}"}
+    collectParentheses = []
+    
+    for i, c in enumerate(s):
+      if i == 0 and c in mapParentheses.values():
+        return False
+          
+      if c not in mapParentheses.keys() and c not in mapParentheses.values():
+        return False
+      
+      if len(collectParentheses) == 0 and c in mapParentheses.values():
+        return False
+      
+      if mapParentheses.__contains__(c):
+        collectParentheses.append(c)
+        continue
+      
+      lastCheck = collectParentheses[-1]
+      if mapParentheses.get(lastCheck) == c:
+        collectParentheses.pop()
+        continue
+      else:
+        return False
+
+    return len(collectParentheses) == 0
+
+print(Solution().isValid("(]")) #false
+print(Solution().isValid("()[]{}")) #true
+print(Solution().isValid("([])")) #true
+print(Solution().isValid("(}{)")) #false
+print(Solution().isValid("([{}])")) #true
+print(Solution().isValid("(){}}{")) #false
+print(Solution().isValid("(([]){})")) #true
diff --git a/Medium/longest_subtstring_without_repeating_characters.py b/Medium/longest_subtstring_without_repeating_characters.py
@@ -0,0 +1,28 @@
+class Solution(object):
+    def lengthOfLongestSubstring(self, s):
+        """
+        :type s: str
+        :rtype: int
+        """
+        if not s or len(s) > 50000:
+            return 0
+        
+        longestSubtstring = 1
+        startIndex = {}
+        startPosition = 0
+            
+        for i, c in enumerate(s):
+            if c in startIndex and startIndex[c] >= startPosition:
+                startPosition = startIndex[c] + 1
+                
+            startIndex[c] = i
+            longestSubtstring = max(longestSubtstring, i - startPosition + 1)
+            
+        return longestSubtstring
+        
+print(Solution().lengthOfLongestSubstring("abcabcbb")) #3
+print(Solution().lengthOfLongestSubstring("bbbbb")) #1
+print(Solution().lengthOfLongestSubstring("pwwkew")) #3
+print(Solution().lengthOfLongestSubstring("")) #0
+print(Solution().lengthOfLongestSubstring("au")) #2
+print(Solution().lengthOfLongestSubstring("aab")) #2
