search

godkingjay / LeetCode

LeetCode Solutions
MIT License
33 stars 65 forks source link

[PROBLEM] 5. Longest Palindromic Substring #182

Closed godkingjay closed 1 year ago

godkingjay commented 1 year ago

Difficulty

Medium

Problem Description

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.

Link

https://leetcode.com/problems/longest-palindromic-substring/

chiku011 commented 1 year ago

can you assign this issue to me

ankitkumar0622 commented 1 year ago

Hi @godkingjay can you please assign this task to me.