Added the Longest Palindromic Substring Solution

Author: bislara

LeetCode/0005_Longest_Palindromic_Substring.py

@@ -0,0 +1,38 @@
+'''
+Problem:-
+
+Given a string s, find the longest palindromic substring in s. 
+You may assume that the maximum length of s is 1000.
+
+Example 1:
+ Input: "babad"
+ Output: "bab"
+ Note: "aba" is also a valid answer.
+
+'''
+
+class Solution:
+ def longestPalindrome(self, s: str) -> str:
+ 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