LeetCode — Longest Palindromic Substring (Blind Curated)
Given a string
s, return the longest palindromic substring in
A string is called a palindrome string if the reverse of that string is the same as the original string.
Input: s = "babad"
Explanation: "aba" is also a valid answer.
Input: s = "cbbd"
1 <= s.length <= 1000
sconsist of only digits and English letters.
Time complexity: O(N)
Space complexity: O(N)