Task Classes: Add, Then Memoized Fibonacci (OOP)

CodingCitadelLast reported November 2025Low Frequency

Reported: 1× across candidate reports
First seen: November 2025
Last reported: November 2025
Reported outcome: unknown

Problem Overview

Citadel coding question, reconstructed from 1 candidate report (November 2025). Candidates reported 1 follow-up. The write-up includes a Python solution that passes 13 test cases.

1 candidate-reported follow-up — the probes candidates report being asked, with the trigger for each
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.