Count Palindromic Substrings, Fast
Mastery
Count the substrings of s that are palindromes (substrings at different positions count separately, even if they look the same).
For "aaa" the answer is 6.
The starter code expands around every centre separately. It is correct but too slow on long repetitive strings.
Examples
Example 1
Input:
count_palindromes_fast('aaa')
Output:
6
Example 2
Input:
count_palindromes_fast('abc')
Output:
3
Constraints
0 <= len(s) <= 200000- Lower-case letters.
Theory
Go to TheoryKeywords
dsa-sheetadvanced-stringshashing-and-structure
Run your code to see results
No results yet
Run your code to check it against the examples, or submit to run every test.