Citadel Interview Questions
Curated from verified interview reports: quant-adjacent algorithmic Coding and CodeSignal-style OA rounds - geometry, graph/DAG ordering, expression evaluation, and combinatorics.
9 real interview questions reported from Citadel Software Engineer interviews (Coding, OA rounds): 7 medium, 2 hard. Each question shows its interview round and how often it was reported, and coding questions come with runnable tests.
Citadel Coding round questions (8)
- Closest Point Pair - Medium, free preview
Find the minimum Euclidean distance between any two points; the interview follow-up is why an O(n²) scan is not the intended solution. - DAG Order Validator - Medium, free preview
Given a DAG and a proposed node order, verify whether every edge points forward and every node appears exactly once. - Dial Pad Knight Paths - Medium
Count how many length-n phone numbers a chess knight can dial on the keypad, modulo 1e9+7. - Expression Evaluator - Medium
Evaluate a tokenized Reverse Polish Notation expression, paying close attention to operand order and truncating division toward zero. - Flight Itinerary Planner - Hard
Use every ticket exactly once, start from JFK, and choose the lexicographically smallest valid itinerary when multiple routes exist. - Minimum Sum Tree Path - Medium
Given a binary tree in level-order form, return the smallest sum across all root-to-leaf paths. - Pandigital Addition Count - Hard
Count how many equations of the form ABC + DEF = GHIJ use each digit 0-9 exactly once with no leading zeroes. - Social Network Friend Suggester - Medium
For each user, recommend the non-friend with the most mutual friends; ties break to the smallest user id.
Citadel OA round questions (1)
- [CodeSignal] Common Free Slot - Medium
Given two non-overlapping availability lists, return the earliest overlap long enough for a meeting of the requested duration.