Citadel Software Engineer interview questions

106 Software Engineers have shared notes from their Citadel interviews, with the questions they were asked in each round. That is 76% of the 140 Citadel interview notes on Screna AI.

106 Software Engineer interview notes

Citadel·Software Engineer·Technical Phone Screen

Oct 2026
Did two rounds for a Citadel SWE intern position and got rejected before the super day, which stings. First round was an OOD question that went sideways pretty fast, second was an AI-assisted coding round that actually felt great. Disappointing result overall, especially as a Canadian trying to break into the US market.
  • Design an object-oriented system for a given problem, and implement the solution.
  • Solve a coding problem (algorithmic), then discuss its trade-offs, optimizations, and alternative approaches.

“This one was rough before I even typed a line.”

View Post

Citadel·Software Engineer·Technical Phone Screen

Sep 2026
Went into a Citadel SWE intern round completely cold, no leetcode prep, and got hit with a stateful data structure plus object-oriented design problem that had an optimization component baked in. Got maybe halfway through before time ran out and the interviewer was visibly checked out, phone in hand, mic picking up background noise the whole time. Not great.
  • Design and implement a custom stateful data structure with object-oriented principles and a greedy optimization component, adjusting your approach as new constraints are introduced mid-problem.

“I went in expecting a standard algorithm question and got something completely different.”

View Post

Citadel·Software Engineer·Technical Phone Screen

Sep 2026
Did two rounds for Citadel's SWE intern position and got rejected before the super day, which stings. First round was an OOD question that went sideways fast, second was an AI-assisted coding round that felt great but apparently wasn't enough.
  • Design an object-oriented system for a given scenario, and implement a working solution.
  • Solve a coding problem (similar to a standard algorithm question), then discuss trade-offs, limitations, and potential optimizations of your solution.

“The interviewer showed up 15 minutes late and still cut the session short, which left almost no time to actually build anything.”

View Post

Citadel·Software Engineer·Onsite - Coding / Algorithms

Jul 2026
Interviewed at Citadel and ran out of time on both coding questions in round 1. The whiteboard and systems discussion went fine but never actually finished implementing anything, which is stressing me out.
  • Lengthy coding problem requiring full implementation under time pressure.

“Both questions in my round were just too long to finish in the time given.”

View Post

Citadel·Software Engineer·Technical Phone Screen

Jul 2026
Went into a Citadel SWE intern round 1 completely cold, no leetcode prep, and got hit with a stateful data structure and OOD problem that had an optimization twist. Did not finish. Interviewer was half-checked out the whole time and I'm still thinking about the money I probably left on the table.
  • Design and implement a custom stateful data structure with object-oriented principles and a greedy optimization component, adapting your approach as new constraints are introduced mid-problem.

“I picked an approach early and the interviewer dropped new information on me, so I had to pivot.”

View Post

Citadel·Software Engineer·Technical Phone Screen

Jul 2026
Did two 45-minute interviews for the Citadel SWE intern role and came out feeling pretty mixed. First one was rough, couldn't finish the implementation. Second went a lot better and I actually got working output, so hoping that balances things out.
  • Implement a system design or object-oriented design problem with working code.

“First interview was a disaster for this.”

View Post

Citadel·Software Engineer·Onsite - System Design / Architecture

Jul 2026
Citadel system design round, four questions back to back covering messaging systems, database tradeoffs, and concurrency. Pretty dense for a single session and the deadlock question came out of nowhere at the end when my brain was already fried.
  • How do message queues help decouple services and handle traffic spikes, and what are the tradeoffs between at-least-once, at-most-once, and exactly-once delivery semantics?
  • Compare push versus pull models for event consumption. How do they differ in terms of latency, throughput, backpressure handling, and complexity on the client side?
  • When would you pick a NoSQL database over a relational one? Walk through how data modeling, consistency guarantees, horizontal scaling, and query patterns factor into that decision.
  • What is a deadlock in concurrent or distributed systems, and what strategies exist to prevent, avoid, detect, and recover from them?

“I actually felt decent about this one.”

View Post

Citadel·Software Engineer·Technical Phone Screen

Jul 2026
Citadel software engineer interview with two pretty brutal algorithmic problems. Both required careful thinking about edge cases and complexity, and I left feeling like I'd only half-solved each one.
  • Given an integer array, choose three cut points to split it into four contiguous segments. Define a value as (sum of segment 1) minus (sum of segment 2) plus (sum of segment 3) minus (sum of segment 4), where the segments appear in order. Find the maximum possible value over all valid cut choices, including cases where cuts coincide or fall at the boundaries.
  • There are n developers each with a unique skill level. Each developer will only join a team if the number of selected teammates with lower skill is within their personal lower-skill tolerance, and the number with higher skill is within their higher-skill tolerance. Find the largest valid team where every selected member's constraints are satisfied simultaneously.

“Spent the first few minutes just trying to understand what the alternating sign pattern was actually doing.”

View Post

Citadel·Software Engineer·Technical Phone Screen

Jul 2026
Citadel SWE interview with two algorithm-heavy problems, both requiring you to think carefully about string structure and cost optimization under constraints. The problems were harder than I expected and I left unsure how clean my solutions actually were.
  • Given a lowercase string and an integer k, find the minimum number of character changes needed to make the string both a palindrome and periodic with period k (i.e., every character equals the one k positions ahead of it).
  • Given n images each active over a date range with an associated filter cost, and a fixed discount price you can apply on any day to replace that day's total cost, find the minimum total processing cost across all days modulo 1,000,000,007.

“This one took me a while to untangle.”

View Post

Citadel·Software Engineer·Technical Phone Screen

Jul 2026
Citadel quant researcher interview, got hit with a classic combinatorics/CS problem that I thought I knew but fumbled the complexity analysis on. The follow-up about scaling to huge n was the part that really separated candidates I think.
  • Implement a simulation of the Josephus problem: n people in a circle, eliminate every k-th person starting from person 1, return the surviving position.
  • Derive and implement the O(n) recurrence solution for the Josephus problem: J(1,k)=0, J(n,k)=(J(n-1,k)+k) mod n, iteratively with O(1) space.
  • When would you prefer the simulation approach versus the recurrence-based approach, and how would you handle the case where n is on the order of 10^9?

“I went straight to a list-based simulation and it worked fine.”

View Post