5. Longest Palindromic Substring

[LeetCode] 5. Longest Palindromic Substring

5. Longest Palindromic Substring Medium Given a string s, return the longest palindromic substring in s. Example 1: Input: s = "babad" Output: "bab" Explanation: "aba" is also a valid answer. Example 2: Input: s = "cbbd" Output: "bb" Constraints: 1 = 0 and r self.res_cnt: self.res_cnt = ans self.res = s[l + 1 : r] for i in range(le..