MediumAcceptance: 29.4%
5. Longest Palindromic Substring
Description
Given a string s, return the longest palindromic substring in s.
Examples
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.
Topics
StringDynamic Programming
💡 Tip: Start with a brute force solution and then optimize. Don't worry about performance initially.
Want more challenges?
Explore more coding challenges and improve your problem-solving skills
Browse All Challenges →