Citadel Software Engineer Interview: Coding & Quant Round
- Sort out which Citadel you are interviewing with, because the fund and the market maker grade the coding round differently
- Know the OA: two hard problems, a short clock, a full hidden-test pass, and working code that can still be a reject
- See which problem families recur, and where the probability, brainteaser and mental-math round fits
Before you prep a single problem, settle one thing: which Citadel is on your calendar. The name sits on two separate companies under Ken Griffin, and they run their own loops. Citadel is the hedge fund, the buy side, where engineers build the platform, data, and research tooling that the investment process runs on. Citadel Securities is the market maker, the sell side, quoting roughly a quarter of US cash equities and about a third of listed options. There the engineering is low-latency C++ threaded through the order path. Same brand, same brutal bar, different center of gravity in the interview.
The fund's software loops read like a faster, harder version of a big-tech screen. Strong algorithms, language-agnostic, graded hard on speed and correctness. The market maker keeps that bar and stacks performance and optimization on top. And for anything that touches trading or pricing, it adds the probability and mental-math round that is the quant fingerprint of this firm. One disambiguation is worth doing once. None of this is The Citadel, the military college in South Carolina. Its Honor and Duty creed has nothing to do with the trading floor, and only surfaces because search engines confuse the two.
How the assessment runs
The gate for most software and campus pipelines is an online assessment, usually on HackerRank, and it is where the funnel narrows hardest. The common shape is two problems in roughly sixty-five to seventy minutes, auto-graded against hidden test cases, skewed medium-hard with the occasional hard. You typically get a ten-day window to open the link once it lands, but the clock inside is tight. The Citadel Securities C++ pipeline often looks different: one problem in about seventy minutes, framed as an optimization or refactor rather than a blank page, and sometimes served on CodeSignal instead. Live rounds run in a shared editor, Coderpad-style. Some show you only a single visible test, so you cannot lean on the grader to tell you when you are done. The dedicated Online Assessment lesson breaks down the platform, the clock, and how it is graded.
- Platform: HackerRank OA, live Coderpad. The assessment is usually HackerRank, sometimes CodeSignal for Citadel Securities. Live coding runs in a shared editor, occasionally with just one visible test case, so you verify correctness yourself.
- OA shape: 2 problems, ~65 to 70 min. The software norm. Auto-graded on hidden tests, medium-hard leaning hard. Citadel Securities C++ pipelines often run one ~70-min optimization problem instead. Formats drift by year, region, and entity.
- Full pass expected: Partial credit rarely advances. The hidden cases target the edge you skipped: empty input, a single element, self-loops, overflow, mod arithmetic. A timeout on a slow solution is a first-class failure, not a near miss.
- Feedback: Fast or silent, not fixed. Early stages can turn around next morning; experienced loops report eight-plus business days or a silent reject. Offers can be short-fuse. Do not read slow feedback as a no, and do not assume speed.
The families that come up
Citadel does not hand out a question list, and it is one of the more opaque firms on this axis. But the shape of what gets asked is steady across candidate reports, and it is lopsided toward a few families. The tilt is more contest-flavored than a clean big-tech screen. Counting problems want a closed form or a recurrence mod 1e9+7. Constraints get tuned so the naive solution times out. And the occasional puzzle rewards math over a memorized template.
Dynamic programming and counting-with-modulo sit on top, which is the clearest way Citadel diverges from a typical FAANG screen. Prefix-sum and hashing arrays, graph and shortest-path work, and heap-and-stream problems fill the middle. Bit and number-theory problems lean Securities-flavored, and a Trie or autocomplete design turns up in phone screens. The C++ optimization refactor takes correct-but-slow code and drives it to a single linear pass. That is the market-maker signature, so it earns its own treatment later in the section rather than a slice of a chart.
What this section covers
Five lessons follow. The first four carry the algorithm families in roughly the order they matter. Each opens with how the firm frames the pattern and the variants it favors. Then it hands you the most-asked problems as runnable exercises, with worked follow-ups stacked the way the round stacks them. The fifth is the quant round, taught as method rather than runnable code. Where a lesson rests on a base algorithm, the full walkthrough lives in the Foundations course and is linked, so these pages stay on what is specifically Citadel.
Arrays, Strings & Hashing
The prefix-sum and sliding-window core: a Premium question where the ends equal the middle sum, longest window under a frequency cap, minimize max-minus-min after a forced step, and binary-search-on-the-answer. Start here.
Dynamic Programming
The dominant online-assessment family: counting arrangements and colorings mod 1e9+7, no-consecutive scheduling counts, run-length string counting, and the classic a Premium question and tree-path anchors, all tuned so the naive version times out.
Graphs & Trees
Shortest-path work where breadth-first is the graded instinct and depth-first is the trap, minimum knight moves that force a bidirectional search, best currency-conversion paths with the self-loop edge case, and friend-recommendation intersections.
Heaps & Intervals
Two-heap median from a data stream with the empty-stream base case, merging many event streams with running price state, and greedy interval covering. The streaming problems that map straight onto market-data feeds.
Probability, Brainteasers & Mental Math
The quant gate for quant, quant-dev, and NXT tracks: expected value and fair-price games, combinatorics and Bayes, gambler's-ruin and random walk, make-me-a-market pricing, and the timed arithmetic sprint. Taught as method, not runnable code.
Common questions
What coding questions does Citadel ask?
Two problems per online assessment, medium-hard leaning hard, from a lopsided set of families. Dynamic programming and counting under a 1e9+7 modulo lead. Prefix-sum and hashing arrays, breadth-first shortest path, and heap or data-stream problems follow. Constraints are tuned so the naive solution times out, and Citadel Securities roles add a C++ optimization refactor. There is no published list, so prepare the families that recur rather than a fixed problem set.
Does Citadel use LeetCode or HackerRank?
The online assessment is usually on HackerRank, with CodeSignal on some Citadel Securities pipelines; live rounds run in a CoderPad-style shared editor. The problems are LeetCode-style algorithm questions, so LeetCode is useful practice, but the bar is harder and more contest-flavored than a typical big-tech screen.
How hard is the Citadel software engineer coding interview?
Harder and faster than a FAANG loop. A correct, working solution to a hard problem can still be a reject: the bar is optimality, the right algorithm chosen first, and edge cases caught unprompted, all under a fast clock. A timeout on the assessment is a failure, not a near-miss. Prepared candidates who reach optimal quickly clear it.
Key Takeaways
- ✓Settle the entity and role first. Citadel the hedge fund runs language-agnostic algorithm loops; Citadel Securities adds C++ and latency; quant, quant-dev, and NXT tracks add the probability round. Weight your prep to your track, because guessing wrong burns the prep time you have before a short-fuse loop.
- ✓The online assessment is the hardest gate: usually two problems in about sixty-five to seventy minutes on HackerRank, graded on full hidden-test pass, with a timeout counting as a failure. Citadel Securities often swaps in one C++ optimization problem instead.
- ✓A correct, working hard solution can still be a reject. The bar is optimality, the right algorithm chosen first (breadth-first for shortest path, not depth-first), and edge cases surfaced unprompted. Prepare for margin, not just for a solution that runs.
- ✓Dynamic programming and counting-with-modulo lead the families, followed by prefix-sum arrays, graphs and shortest path, and heap-and-stream problems. Probability and brainteasers are a real round but gated to the quant-adjacent tracks, not the spine of a core software loop.
Citadel interview guideKnow what Citadel asks before you walk in.
12 coding · 5 system design · 15 behavioral questions
Get their questions first.
InterviewLegend is independent and not affiliated with or endorsed by any company it covers.