Citadel Coding Interview Questions
25 Citadel coding interview problems with full optimal solutions — 8 easy, 12 medium, 5 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Citadel interviewer values, and a FAQ section.
Showing 17 problems of 25
- #3mediumfrequently asked
3. Longest Substring Without Repeating Characters
Sliding window on a character stream is a core primitive in financial data processing — think deduplicating a stream of order IDs, finding the longest non-redundant price sequence, or scanning for unique symbol windows in tick data. Citadel uses this problem to verify you can implement an O(n) shrinkable window correctly.
- #15mediumfrequently asked
15. 3Sum
3Sum tests whether you can compose a known primitive (Two Sum) into a harder problem and handle duplicate suppression correctly. Citadel often uses it as the natural escalation after Two Sum, specifically probing your O(n²) two-pointer approach and whether you can articulate why sorting is the enabling step.
- #20easyfrequently asked
20. Valid Parentheses
Citadel asks Valid Parentheses to test stack discipline. In financial systems, bracket-matching logic underpins expression parsers for formula engines, query validators, and order-instruction parsing — getting the stack mechanics exactly right under all edge cases matters.
- #21easyfrequently asked
21. Merge Two Sorted Lists
Merging two sorted lists is the inner loop of merge sort and a primitive in time-series data fusion. At Citadel, this maps directly to merging two ordered streams of market events from separate exchanges. Interviewers watch whether you use a dummy head node and whether you handle leftover tails cleanly.
- #23hardfrequently asked
23. Merge K Sorted Lists
Merging K sorted streams is a critical primitive in market data aggregation — combining order flow from K exchanges into a single time-ordered feed. Citadel uses this as a hard problem to test heap fundamentals, divide-and-conquer thinking, and whether you can argue O(n log k) vs O(nk) with precision.
- #42hardfrequently asked
42. Trapping Rain Water
Trapping Rain Water is a high-signal hard problem at Citadel — it has three fundamentally different O(n) solutions (prefix/suffix max arrays, two-pointer, monotonic stack), and the interviewer will ask for all of them. It also tests mathematical reasoning: the water at position i is determined by min(leftMax, rightMax) − height[i].
- #49mediumfrequently asked
49. Group Anagrams
Group Anagrams is a hashing canonicalization problem: find a transformation that maps equivalent items to the same key. At Citadel, this pattern appears in symbol normalization (mapping ticker aliases to a canonical identifier) and in deduplication pipelines. The interview tests whether you choose the right canonical key — sorted string vs. frequency count.
- #53easyfrequently asked
53. Maximum Subarray
Kadane's algorithm is a staple in quantitative finance: finding the highest-return contiguous window in a P&L series, identifying the best momentum run in a price series, or detecting the worst drawdown period (negate the array). Citadel interviewers expect you to name the algorithm, prove it greedy, and know the divide-and-conquer alternative.
- #56mediumfrequently asked
56. Merge Intervals
Interval merging is a direct analog of consolidating overlapping trading windows, computing continuous market hours, or merging order-book time slots. Citadel uses this problem to test sort-first reasoning and the ability to handle all overlap cases correctly — especially the 'contained within' edge case.
- #70easyfrequently asked
70. Climbing Stairs
Climbing Stairs is Citadel's entry point for dynamic programming. The interviewer is checking whether you recognize the Fibonacci recurrence, state the subproblem clearly, and then optimize space from O(n) to O(1). Expect the question to pivot toward probability: 'What if each step choice is made with probability p?'
- #139mediumfrequently asked
139. Word Break
Word Break is a DP problem about partitioning — given a string and a dictionary, can the string be segmented into valid words? At Citadel, analogous problems appear in pattern recognition on order strings and in tokenizing structured text streams. The interview tests DP state definition and whether you avoid re-checking overlapping subproblems.
- #200mediumfrequently asked
200. Number of Islands
Number of Islands is a graph traversal problem disguised as a 2D grid. At Citadel, graph connectivity appears in portfolio risk analysis (connected components of correlated positions) and in network topology modeling. The interview probes BFS vs DFS choice and whether you can modify the grid in-place to avoid a visited set.
- #206easyfrequently asked
206. Reverse Linked List
Citadel uses Reverse Linked List to probe pointer fluency. Linked-list structures appear in lock-free queues, custom memory allocators, and order-book implementations. Getting pointer reassignment exactly right — and knowing when to use iterative versus recursive — demonstrates the low-level discipline Citadel expects.
- #207mediumfrequently asked
207. Course Schedule
Cycle detection in a directed graph is a fundamental primitive in dependency resolution — trade execution sequencing, pipeline DAG validation, and margin calculation dependency graphs all require verifying no circular dependencies exist. Citadel expects both DFS (with coloring) and topological-sort (Kahn's) approaches.
- #238mediumfrequently asked
238. Product of Array Except Self
This problem prohibits division and demands O(1) extra space (excluding output) — a tight constraint that forces a prefix/suffix product pattern. At Citadel, this mental model maps to computing rolling window statistics on time-series data while excluding the current observation. The constraint bar is a deliberate filter.
- #322mediumfrequently asked
322. Coin Change
Coin Change is the canonical unbounded knapsack problem and a gateway to understanding DP on finite targets. At Citadel, structurally identical problems appear in portfolio replication (can you replicate a target payout using a minimum number of instruments?). The interview tests whether you define the DP state precisely and initialize correctly.
- #347mediumfrequently asked
347. Top K Frequent Elements
Top-K selection shows up constantly in quantitative finance: top-K movers by volume, top-K securities by realized volatility, top-K events by arrival rate. Citadel expects you to know all three approaches — sort, min-heap, and bucket sort — and choose the right one based on the relationship between n and k.