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).