cpp-flashcards/org/study_deck_02/dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org

• 0005. Longest Palindromic Substring
  • Approach
  • Python
  • C++

TODO 0005. 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 <= s.length <= 1000
• s consist of only digits and English letters.

TODO Approach

Write your approach here.

TODO Python

class Solution:
    def longestPalindrome(self, s: str) -> str:

TODO C++

class Solution {
public:
    string longestPalindrome(string s) {
        
    }
};