Count Length-5 Palindromic Subsequences in a Binary String

OACitadelLast reported February 2025Low Frequency
Reported
1× across candidate reports
First seen
February 2025
Last reported
February 2025
Reported outcome
unknown

Problem Overview

Citadel online assessment question, reconstructed from 1 candidate report (February 2025). The write-up includes a Python solution that passes 6 test cases.

  • The full problem statement — full requirements, constraints, and edge cases
  • Approach and trade-offs — what passing candidates did, and the mistakes that sink people
Unlock the full Citadel catalog
Full problem statements, candidate-reported follow-ups, and walkthroughs — for every Citadel question.
Unlock with Pro
Already a member? Sign in
Verified Source
Every question is reconstructed from multiple independent candidate reports. Follow-ups candidates reported, not invented ones.
Codex Fact-Checked
Technical claims, formulas, and scale numbers are reviewed against primary sources.
Interviewer Follow-ups
The follow-ups candidates reported, with the trigger that prompts each one — plus the mistakes that sink people.
Is this helpful?