codingstuff.io
ExploreTutorialsProblemsCS Subjects
Get Started
ExploreTutorialsProblemsCS Subjects
Get Started
codingstuff.io

Master the art of building software through interactive tutorials, real-world problems, and guided projects.

Pune, Maharashtra, India

codingstuffmail@gmail.com

Product

  • Explore
  • Tutorials
  • Problems
  • CS Subjects

Company

  • About
  • Contact
  • Privacy Policy
  • Terms & Conditions
  • Sitemap

© 2026 codingstuff.io. All rights reserved.

Built with ❤️ for developers everywhere

ProblemsLongest Palindromic Substring

Longest Palindromic Substring

Medium
StringsDynamic 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"

 

Constraints:

  • 1 <= s.length <= 1000
  • s consist of only digits and English letters.

Related Problems

View all
Valid Palindrome
Easy•Strings
Longest Substring Without Repeating Characters
Medium•Strings
Longest Repeating Character Replacement
Medium•Strings
Minimum Window Substring
Hard•Strings
Valid Anagram
Easy•Strings
Group Anagrams
Medium•Strings
Input:
s = &quot;babad&quot;