Files
cpp-flashcards/org/study_deck_02/dsa/1-d-dynamic-programming/0005-longest-palindromic-substring.org
T
tomatocream 1dec88aaf2 feat: populate note files with problem descriptions and code stubs
Add populate-notes.mjs that fetches problem descriptions and
Python/C++ code stubs from LeetCode's GraphQL API. Populated
all 197 NeetCode 150 note files with:
- Problem description (examples, constraints)
- Python code stub (function signature)
- C++ code stub (function signature + includes)

API responses cached in leetcode/.cache/leetcode/ for instant re-runs.
2026-06-01 17:22:07 +08:00

843 B

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) {
        
    }
};