Available question text
Given a string, count the number of special palindromic substrings where a special palindrome is defined as either having all identical characters or having all characters identical except for the middle character. Return the total count of such substrings that can be formed from the input string.
Related questions
Continue with questions that share topics or the same question type.
- Count Beautiful Substrings I
Coding
- Count Beautiful Substrings II
Coding
- Count Binary Palindromic Numbers
Coding
- Count Binary Substrings
Coding · String · Two Pointers
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
6sense
Count Special Palindromic Substrings
Reported Feb 19, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source