Count Palindromic Substrings

Problem Overview

• Count the number of palindromic substrings in a given lowercase string S; each occurrence by position counts.
• Input: a string of lowercase English letters; Output: an integer count; constraints not specified.
• Domain: string processing and text analysis, focusing on palindrome detection within substrings.
• This Purestorage interviews coding interview problem is a common interview question.