← Questions
Count palindromic substrings
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Count the substrings of a string that are palindromes, counting each position separately. Expanding around every centre gives O(n^2) time and O(1) space.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding