Citadel Interview Questions
Reconstructed from 127 verified candidate reports across 62 questions. Jan 2025 – Sep 2026.
This page is a live view of every Citadel interview question AceOffer has indexed — pulled from real candidate reports, not invented from job descriptions or one founder’s memory. Every question shows how many times it’s been reported and when it was last seen. The catalog gets a refresh pass every month.
Key facts
- •62 distinct Citadel interview questions indexed
- •127 candidate reports across the catalog
- •Most reported: Resume Project Deep-Dive — 9× (last seen September 2026)
- •Reports span Jan 2025 – Sep 2026
- •Refreshed monthly · last updated September 2026
Browse Citadel interviews by topic
The Citadel loop, from candidate reports
Citadel's software loop varies more by role and by firm than most. The forum label covers both Citadel and Citadel Securities; one forum reply says the two recruit through the same process and only separate at team match, and another was asked in the screen what the difference between them is. Campus intern and new-grad candidates usually start with a HackerRank assessment of two coding problems in 75 minutes, then a 45-minute technical screen, then a final round of three 45-minute interviews. Experienced candidates on the NXT backend track report a HackerRank assessment that mixes multiple-choice questions on caching, locks, message queues, complexity and debugging with a coding problem, most often finding the earliest free meeting slot. Screens often spend 10 to 30 minutes on your resume before one coding problem, and one candidate found the resume questions more detailed than at other companies while another found them more stressful than the coding. The problems lean toward trading-flavoured data structures, such as order books with best bid and offer, merging sorted price feeds, LRU caches and ring buffers, alongside standard LeetCode problems. Citadel Securities reports frequently specify C++, and its experienced-hire onsites run as a day of four or five one-hour rounds; one candidate describes being sent home partway through the day. Frontend candidates report JavaScript fundamentals and a React trade-event dashboard.
What does Citadel ask in each interview round?
Citadel interviews span 6 distinct round types, broken down below. Counts reflect distinct questions per round, not number of times asked. Frequencies on individual question cards show how many candidates reported getting that specific question.
Which Citadel interview questions come up most?
These are the Citadelquestions reported most across the loops we’ve indexed, sorted by candidate-report frequency.
| Question | Round | Reported | Last seen |
|---|---|---|---|
| Resume Project Deep-Dive | Tech Deep Dive | 9× | September 2026 |
| Most Challenging Project / Challenge You Overcame | Behavioral | 6× | August 2026 |
| NXT OA Multiple-Choice Topics (OS, Systems, Complexity) | OA | 6× | September 2026 |
| Merge K Sorted Feeds (Cumulative Price Variant) | Phone Screen | 6× | September 2026 |
| Count (Distinct) Palindromic Substrings (LC 647 variant) | OA | 5× | June 2026 |
| Earliest Free Meeting Slot from Event Strings | OA | 5× | August 2025 |
| Why Citadel / Why Finance (Behavioral) | Phone Screen | 4× | December 2025 |
| Order Book / Matching Engine Implementation | Coding | 4× | July 2026 |
| Most Impactful / Proudest Project (BQ) | Behavioral | 3× | July 2026 |
| Topological Sort of Task Dependencies | Phone Screen | 3× | August 2026 |
The full index is below, or browse the Citadel catalog →
Every Citadelinterview question we’ve indexed
All 62, grouped by round and sorted by how often candidates reported them. Each links to the question, its reported follow-up count, and when it was last seen.
Phone Screen (25)
- Merge K Sorted Feeds (Cumulative Price Variant) — reported 6×, last seen September 2026
- Why Citadel / Why Finance (Behavioral) — reported 4×, last seen December 2025
- Topological Sort of Task Dependencies — reported 3×, last seen August 2026
- LRU Cache (with LFU / Custom Eviction Follow-ups) — reported 3×, last seen January 2026
- Closest Pair of Points in 2D (Divide and Conquer) — reported 2×, last seen August 2026
- Circular Buffer in C++, Then Single-Producer Multi-Consumer — reported 2×, last seen March 2026
- Trapping Rain Water (LC 42) — reported 2×, last seen April 2025
- Order Book: Exchange BBO and NBBO — reported 2×, last seen September 2026
- RPN Expression Evaluator with User-defined Operators — reported 1×, last seen March 2025
- Alien Dictionary (LC 269) — reported 1×, last seen December 2025
- Knight Paths on a Phone Keypad (1 to 9 in <=10 Moves) — reported 1×, last seen January 2026
- Find All Elements Equal to K in a Sorted Array — reported 1×, last seen June 2026
- N-ary Tree: Sum Values, Then Link Leaves in O(1) Space — reported 1×, last seen June 2026
- Min Subarray from Each Index Covering All Talents — reported 1×, last seen May 2025
- Number of Islands (LC 200 → 694 → 305) — reported 1×, last seen December 2025
- Reconstruct Itinerary Without Fixed Start (Eulerian Path) — reported 1×, last seen September 2025
- Trade Reconciliation: Find Unmatched Buy/Sell Trades — reported 1×, last seen September 2026
- Implement a BST from Scratch in C++ (insert/search/delete) — reported 1×, last seen January 2026
- Game of Life: In-Place, Sparse and Infinite Board — reported 1×, last seen March 2026
- Shortest Path with Fuel Tank and Gas Stations — reported 1×, last seen January 2025
- Median of Two Sorted Arrays (LC 4) — reported 1×, last seen January 2025
- Sliding Window Top-K Elements — reported 1×, last seen June 2026
- Intersection of Multiple Arrays (LC 2248) — reported 1×, last seen July 2025
- SRE Python Screening: Five Short Functions — reported 1×, last seen August 2026
- External Merge Sort with a Heap — reported 1×, last seen July 2026
OA (18)
- NXT OA Multiple-Choice Topics (OS, Systems, Complexity) — reported 6×, last seen September 2026
- Count (Distinct) Palindromic Substrings (LC 647 variant) — reported 5×, last seen June 2026
- Earliest Free Meeting Slot from Event Strings — reported 5×, last seen August 2025
- Min Changes to Make Password a K-Periodic Palindrome — reported 3×, last seen September 2025
- Best Substring by Prefix/Suffix Match Score — reported 3×, last seen March 2025
- Tree Diameter Endpoints via Double BFS (LC 1245-style) — reported 3×, last seen June 2026
- Token Expiry and Reset Simulation (LC 1797-style) — reported 3×, last seen June 2026
- Optimise root_node() C++ from O(N²) to O(N) — reported 2×, last seen September 2026
- Prefixes Extendable to Exactly K '10' Subsequences — reported 2×, last seen September 2025
- Max Gross Value of a Four-Way Array Split — reported 2×, last seen September 2025
- Friend Recommendation by Most Common Friends — reported 2×, last seen April 2025
- Best Downward Path Sum in a Tree — reported 2×, last seen April 2025
- Largest Hackathon Team Under Skill-Rank Constraints — reported 2×, last seen October 2025
- Count Process Schedules with No Consecutive Repeats — reported 2×, last seen December 2025
- Source Key-Value Override in First-Seen Order (NXT OA) — reported 1×, last seen October 2025
- All Achievable MEX Values After Increment Operations — reported 1×, last seen October 2025
- Largest Team with a Core Employee Overlap — reported 1×, last seen December 2025
- Min Cost Image Processing with Daily Discount (OA) — reported 1×, last seen July 2025
Coding (11)
- Order Book / Matching Engine Implementation — reported 4×, last seen July 2026
- Buy and Sell Stock: I → II → k Transactions (DP) — reported 3×, last seen May 2026
- Time-Based Key-Value Store (set/get by timestamp) — reported 2×, last seen February 2026
- Search Suggestion System (Trie, LC 1268) — reported 1×, last seen August 2026
- Find Median from Data Stream (LC 295) — reported 1×, last seen August 2025
- React Trade Event Feed Dashboard with Pause/Resume — reported 1×, last seen July 2026
- Statistics from a 256-Bucket Frequency Array — reported 1×, last seen July 2026
- Deduplicating File System: writefile / readfile — reported 1×, last seen September 2026
- Find Servers That Handled Most Number of Requests (LC 1606) — reported 1×, last seen April 2025
- Implement tac (Reverse cat) with Progressive Optimisation — reported 1×, last seen November 2025
- Thread-Safe Key Counter, Then Cross-Process — reported 1×, last seen May 2026
Tech Deep Dive (3)
- Resume Project Deep-Dive — reported 9×, last seen September 2026
- JavaScript Fundamentals: Promises, Map vs WeakMap, Types, WebSocket Ordering — reported 1×, last seen July 2025
- Implement tail for a Very Large File — reported 1×, last seen May 2026
System Design (3)
- Config Management and Deployment at Scale with Rollback — reported 1×, last seen August 2026
- E-commerce Inventory Design: Concurrency Control — reported 1×, last seen July 2026
- Design a Metrics and Alerting System — reported 1×, last seen July 2026
Behavioral (2)
- Most Challenging Project / Challenge You Overcame — reported 6×, last seen August 2026
- Most Impactful / Proudest Project (BQ) — reported 3×, last seen July 2026
- •Clarifying edge cases before writing code. On the merged price-feed problem, one candidate says the interviewer expected ties on equal timestamps, negative deltas and empty feeds to be settled up front; on the trade-data problems, another advises confirming data volume, timestamp precision, partial fills and whether the input streams.
- •Carrying the first solution through the follow-ups. Screens often escalate one problem in stages: stock trading from one transaction to many to at most k, a tree sum to linking leaves in O(1) space, tac to constant space. One candidate says the interviewer cared most about how the solution generalised, its complexity, space optimisation and edge cases.
- •Knowing heap-based designs well. Order book reports use a max-heap and min-heap per side with lazy deletion, the K-feed merge keeps a heap of size K, and one Citadel Securities intern says every problem in the final round was built on min and max heaps.
- •Preparing your projects as seriously as the problems. Reports describe 20 to 30 minutes of resume questions that ask why each design choice was made; one candidate who passed a Citadel Securities screen spent half of it on the technical difficulties of trading projects and how they were optimised.
- •Practising the company-tagged problems. One candidate who skipped them failed the first problem of the final round, and another rated both problems in one 45-minute round as hard.
- •Losing the coding time to the conversation. When the interviewer or candidate is late, or the introduction and behavioral questions run long, reports describe 15 to 30 minutes left for the problem, and those candidates did not finish or only described the optimal version.
- •Preparing only LeetCode. Some rounds are object-oriented design or data parsing rather than algorithms, such as a time-based key-value store or trade reconciliation over raw data. Candidates who prepared only common problems report being caught out.
- •Stumbling on language details under follow-up. Candidates lost time on C++ shared_ptr and ifstream seeking, and on recalling Java's functional interface when asked to make an expression evaluator extensible; one NXT candidate was dropped after the assessment because HR preferred C++ experience.
- •Leaving testing to the end. One candidate solved both problems in a 45-minute final round but missed an empty input the interviewer supplied and was rejected; another ran out of time on a null-pointer bug.
- •Reading a clean assessment as a pass. More than one candidate passed every visible test case and was still not moved forward, and one had the next interview cancelled because the role was filled.
Get the full Citadel catalog
Every question. Every candidate-reported follow-up. The mistakes that sink people, and what passers do instead. Monthly refresh.
Know someone interviewing at Citadel?
Send them this guide: 62 questions from 127 candidate reports, with the rounds, the follow-ups and what passers do.