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 s consist of only digits and English letters.Topics: Two Pointers / String/ Dynamic Programming 1. Pythonclass Solution: def longestPalindrome(self, s: str) -> str: temp={} for i ..