Longest Palindromic Substring

Longest Palindromic Substring

LeetCode Problem

• Problem Number: 5
• Problem Link: https://leetcode.com/problems/longest-palindromic-substring/
• Difficulty: Medium
• Topics: String, Dynamic Programming

Problem Description

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

Note:

• A palindrome is a string that reads the same forward and backward
• A substring is a contiguous sequence of characters within the string

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 consists of only digits and English letters