Longest Palindromic Substring

Medium

StringDynamic Programming

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" ```

Expected Time Complexity

O(n²)

Expected Space Complexity

O(1)

Example Test Cases

Example 1

Input:

"babad"

Output:

"bab"

Example 2

Input:

"cbbd"

Output:

"bb"

Problem List

Progress0 / 0

No problems found.