Palindromic Substrings — Medium Coding Interview Question

Given a string s, return the number of palindromic substrings in it. A string is a palindrome when it reads the same backward as forward.

Example

Input: s = "abc"

Output: 3

Explanation: Three palindromic strings: 'a', 'b', 'c'.

Constraints

• 1 ≤ s.length ≤ 1000
• s consists of lowercase English letters

Topics & Companies

Topics: strings, dp

Asked by: Amazon, Google, Meta, Microsoft

Optimal Solution Complexity

Time complexity: O(n²). Space complexity: O(1).

Practice more

• All DSA Problems
• DSA Patterns