Week 15: 5. Longest Palindromic Substring Solution

Author: doh6077

longest-palindromic-substring/doh6077.py

@@ -0,0 +1,30 @@
+# 5. Longest Palindromic Substring
+# https://leetcode.com/problems/longest-palindromic-substring/
+
+
+class Solution:
+    def longestPalindrome(self, s: str) -> str:
+        #Expand Around Center
+        res = ""
+        resLen = 0 
+
+        for i in range(len(s)):
+            # odd length 
+            l, r = i, i
+            while l >= 0 and r < len(s) and s[l] == s[r]:
+                if (r - l + 1) > resLen:
+                    res = s[l:r+1]
+                    resLen = r - l + 1
+                l -= 1
+                r += 1
+            
+            # even length 
+            l, r = i, i + 1
+            while l >= 0 and r < len(s) and s[l] == s[r]:
+                if (r - l + 1) > resLen:
+                    res = s[l:r+1]
+                    resLen = r - l + 1
+                l -= 1
+                r += 1
+                
+        return res