Question Details
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 sam
Full Details
🔒
Unlock all Citadel questions
Full insider details, leaked discussions, and candidate experiences.
or every company, $100/year →About This Question
This is a reported interview question from a citadel interview for a swe role during the coding round.
It covers the following topics: Strings .
Difficulty rating: 0