Write Palindromic Substring Counter | Dataford Interview Questions

CRED may need to analyze short message strings for symmetry-based patterns. Given a string s, return the total number of palindromic substrings it contains.

A substring is a contiguous, non-empty sequence of characters. Count palindromic substrings by position, so identical text appearing at different positions is counted separately. For example, the two a characters in "aaa" are separate one-character palindromic substrings.

Formal Specification

Implement count_palindromic_substrings(s).

Input: s, a string containing lowercase English letters.
Output: An integer representing the number of palindromic substrings in s.
A single character is always a palindrome.

Constraints

1 <= len(s) <= 1000
s contains only lowercase English letters
Every non-empty substring occurrence must be counted separately
Overlapping palindromic substrings are included

Function Signature

def count_palindromic_substrings(s):

Your question is Write Palindromic Substring Counter. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem