Citadel software engineer candidates report a HackerRank assessment, recruiter or HR screen, and live coding interviews. Questions lean on dynamic programming, graphs and heaps, with some C++ and systems follow-ups.
$217K
Avg. Base Comp
$403K
Avg. Total Comp
Not reported
Typical Rounds
Not reported
Process Length
Candidates who describe the Citadel software engineer process usually start with an online assessment, often on HackerRank, before or soon after a recruiter conversation. Reports describe it as fast and demanding. One candidate had three LeetCode-medium problems in about 1.5 hours, with at least one dynamic programming question. Another had two coding problems, including a breadth-first search graph question, and another faced a concurrency-optimization task.
In live rounds, dynamic programming, graph traversal and backtracking problems come up repeatedly. Reported examples include a disconnected-graph question, a LeetCode-hard backtracking problem, and a prefix sum plus hashing problem where the interviewer wanted you to explain why the approach is correct. Candidates say interviewers wanted clean code that passes test cases and clear reasoning under time pressure. Some prompts were underspecified, so asking clarifying questions early matters.
One candidate was pushed below the algorithm layer, with questions on operating systems, computer architecture, C++ and language internals, plus implementing a heap with an optimization discussion. Another was asked to design and implement a trading book that adds and removes orders and scales to multiple nodes.
Behavioral content was real but varied. Candidates report resume and project-impact walkthroughs, questions on why Citadel, and compensation expectations in an HR screen. One candidate described a tightly timed round with questions about 60-hour weeks and commitment. Every software engineer report here ended without an offer, so treat the coding bar as high.
Synthesized from 30 candidate reports by our editorial team.
Had an interview recently?
Share your experience. Unlock the full guide.
Real interview reports from people who went through the Citadel Llc process.
Share your own interview experience to unlock all reports, or subscribe for full access.
Sourced from candidate reports and verified by our team.
Topics based on recent interview experiences.
Featured question at Citadel Llc
This problem involves finding the first non-repeating character in a given string. The solution involves iterating over the string and keeping track of the frequency of each character. The first character that has a frequency of 1 is the first non-repeating character.
| Question | |
|---|---|
| Fill None Values | |
| Append Frequency | |
| Equal Binary Subarrays | |
| Concurrent LLM Serving | |
| Implementing the Fibonacci Sequence in Three Different Methods | |
| Binary Tree Validation | |
| Optimistic vs Pessimistic Locking | |
| Check Matching Parentheses | |
| The Pirate’s Hunt | |
| NxN Grid Traversal | |
| Data Stream Median | |
| Decreasing Subsequent Values | |
| Shortest Path Algorithms | |
| LRU Cache 1 | |
| 2nd Highest Salary | |
| Employee Salaries | |
| Merge Sorted Lists | |
| Subscription Overlap | |
| Empty Neighborhoods | |
| Top Three Salaries | |
| Closest SAT Scores | |
| Find the Missing Number | |
| Monthly Customer Report | |
| Rolling Bank Transactions | |
| Top 5 Turnover Risk | |
| Payments Received | |
| Size of Joins | |
| Total Spent on Products | |
| Top 3 Users |
Synthesized from candidate reports. Individual experiences may vary.
Candidates report a timed online assessment, usually on HackerRank. Formats vary: one report describes two coding problems, and another three LeetCode-medium problems in about 1.5 hours. Reported topics include dynamic programming, BFS on graphs and concurrency optimization, so expect speed and clean implementation to matter.
Several candidates describe a recruiter or HR call, one about 30 minutes, covering their resume, project impact and interest in Citadel. One report says compensation expectations came up. Timing relative to the assessment differs between reports, so the order may vary.
Candidates report live technical rounds. One was a one-hour interview that opened with a resume walkthrough before a hard backtracking problem. Problems cited include dynamic programming, graph connectivity, stacks, DFS and prefix sum with hashing. Interviewers typically look for correct, clean code and clear reasoning, and some prompts may be intentionally underspecified.
One candidate reports a technical round on operating systems, computer architecture, C++ and language internals, plus implementing a heap. Another describes a design-and-implement question on a trading book that adds and removes orders and scales to multiple nodes. These do not appear in every account, so prepare them according to your own stack.
One candidate describes a later superday-style loop with multiple technical conversations and a leadership-focused round that mixed technical and behavioral questions. Expect questions on why Citadel and your past projects. Another candidate reported a tightly timed behavioral round with blunt questions about working hours and commitment.
