Leetcode 647. Palindromic Substrings

Count the number of contiguous substrings of s that are palindromes. With |s| up to 1000, the core challenge is to enumerate/detect all palindromic centers efficiently (typical solutions run in O(n^2) or O(n) time).

Asked at:

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Late October, 2025

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 647. Palindromic Substrings

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact