Add solution for Longest Nice Substring

Blacknahil · Feb 29, 2024 · df80c8a · df80c8a
1 parent f33ece2
commit df80c8a
Showing 1 changed file with 8 additions and 0 deletions.
diff --git a/camp1/week3/leetcode/longest-nice-substring.py b/camp1/week3/leetcode/longest-nice-substring.py
@@ -0,0 +1,8 @@
+class Solution:
+    def longestNiceSubstring(self, s: str) -> str:
+        unique=set(s)
+
+        for i,char in enumerate(s):
+            if char.swapcase() not in unique:
+                return max(self.longestNiceSubstring(s[:i]),self.longestNiceSubstring(s[i+1:]),key=len)
+        return s