Palindromic Substrings (LC 647 :P

Problem Overview

• Count how many palindromic substrings appear in a given string.
• Input: string s of lowercase letters (1 ≤ length ≤ 1000); Output: integer count of substrings that read the same forward and backward.
• Domain: string processing and palindrome detection relevant to algorithmic problem solving in a coding interview.
• This interview question has been asked in Citadel interviews and is a classic LeetCode problem.