Longest Palindromic Substring
Medium
String
Dynamic Programming
Given a string `s`, return *the longest palindromic substring* in `s`. For grading purposes on this platform, the chosen test cases each have a unique longest palindromic substring.
Example 1
Input: s = "cbbd"
Output: "bb"
Example 2
Input: s = "racecar"
Output: "racecar"

Constraints

  • •1 <= s.length <= 1000
  • •s consist of only digits and English letters.
Time Complexity
O(n²)
Space Complexity
O(1)
14
Case 1
Input: "cbbd"
Expected: bb
Case 2
Input: "racecar"
Expected: racecar
Case 3
Input: "a"
Expected: a