LeetCode — Longest Palindromic Substring (Blind Curated)

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

A string is called a palindrome string if the reverse of that string is the same as the original string.

Example 1:

Example 2:

Constraints:

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

Solution:

Time complexity: O(N)

Space complexity: O(N)

LeetCode — Longest Palindromic Substring (Blind Curated 1/75)

--

--

👨‍💻

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store