Longest Palindromic Substring — Medium Coding Interview Question

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

Example

Input: s = "babad"

Output: "bab"

Explanation: "aba" is also a valid answer.

Constraints

• 1 <= s.length <= 1000

Topics & Companies

Topics: two-pointers, dp

Asked by: Amazon, Meta, Microsoft

Optimal Solution Complexity

Time complexity: O(n^2). Space complexity: O(1).

Practice more

• All DSA Problems
• DSA Patterns