Home
Log in
DescriptionSubmissionsSolution
DescriptionSubmissionsSolution
Loading...

Log in to run or submit

s =

Codey

Practise coding problems, test your solutions and track your progress.

Explore

  • Problems
  • About
  • Contact

Legal

  • Privacy Policy
  • Terms of Use

© 2026 Codey. Personal learning project.

Solution
Updated: 2026-02-23

Idea

Count palindromes by expanding around all centers.

Approach

For each i, expand odd (i,i) and even (i,i+1) centers, adding 1 for each successful expansion.

Why it works

Every palindromic substring has a unique center.

Code
Loading...
Complexity
Time: O(n^2)
Space: O(1)
Solution
Updated: 2026-02-23

Idea

Count palindromes by expanding around all centers.

Approach

For each i, expand odd (i,i) and even (i,i+1) centers, adding 1 for each successful expansion.

Why it works

Every palindromic substring has a unique center.

Code
Loading...
Complexity
Time: O(n^2)
Space: O(1)