Citadel·Software Engineer·Technical Phone Screen
- Given a tree, find the length of its longest path between any two nodes (the diameter).
“Classic problem, the kind you've either drilled or you haven't.”
Large Enterprises
Most of these Citadel write-ups come from Software Engineers (106), then Data Scientists (33) and Machine Learning Engineers (1). The most reported rounds are the technical phone screen (111), the system design round (16), the onsite coding round (4) and the behavioral / leadership round (3).
140 interview notes · updated Oct 2026
“Classic problem, the kind you've either drilled or you haven't.”
“I knew the 'why Citadel' part was coming and had a decent answer ready.”
“The translation-only constraint is what makes this interesting.”
“This is one question but it's really like six questions stapled together.”
“This ate the whole interview.”
“The key insight is that U(0,a) is just U(0,1) conditioned on being less than a, which is a clean way to think about it but not where my brain went first.”
“I went with a sorted structure per exchange, like a max-heap for bids and min-heap for asks, which felt right until they pushed on cancellations.”
“Went with union-find pretty quickly, which felt right.”
“The add and executeNext parts came pretty naturally, heap with a sequence counter for tie-breaking.”
“This one ate up most of the session.”