#+ANKI_DECK: study_deck_02
* TODO 0005. Longest Palindromic Substring :medium:
:PROPERTIES:
:NEETCODE: [[file:../../roadmap.org::*0005. Longest Palindromic Substring][0005. Longest Palindromic Substring]]
:END:

Given a string ~s~, return /the longest/ /palindromic/ /substring/ in ~s~.

*Example 1:*


#+begin_src
Input: s = "babad"
Output: "bab"
Explanation: "aba" is also a valid answer.
#+end_src


*Example 2:*


#+begin_src
Input: s = "cbbd"
Output: "bb"
#+end_src


*Constraints:*

 - ~1 <= s.length <= 1000~

 - ~s~ consist of only digits and English letters.

** TODO Approach
Write your approach here.

** TODO Python
#+begin_src python :lc-problem 5 :lc-lang python3
class Solution:
    def longestPalindrome(self, s: str) -> str:
#+end_src

** TODO C++
#+begin_src cpp :lc-problem 5
class Solution {
public:
    string longestPalindrome(string s) {
        
    }
};
#+end_src