
Citadel Software Engineer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 407 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at Citadel.
Software Engineer
This finance engineering role cares about algorithmic clarity, meaning you gotta spot patterns fast like prefix sums, sliding windows, graph traversals, or prove greedy/DP ideas. They also dig mathematical reasoning, wanting proofs or invariants for correctness, like why a greedy choice works or a hash trick. Performance instincts are key too: you should be able to talk time complexity, memory vs. speed, and edge cases at scale since latency is money.
- Can you explain prefix sum plus hashing and why it's good for O(1) lookups with heavy data?
- How do you solve the subarray sum divisible by k problem?
- Can you find the longest equal 0/1 subarray?
Software Engineer
The first round involved two technical interviews that were more focused on broad statistical concepts and system design. The second round presented a more open-ended system design challenge where the candidate was expected to ask clarifying questions to nail down specific requirements.
- Design Spotify, incorporating a cost function that varies per user based on their song consumption.
Software Engineer Intern
First, I had an online assessment. After passing that, I moved on to a 45-minute first-round technical interview where I had to solve two LeetCode medium-level coding questions. Following that, there was a superday with three back-to-back 45-minute technical interviews. Unfortunately, I didn't get past that stage.
- Tell me about your resume.
- Do you have any Operating System questions?
- Solve a LeetCode medium technical question.
Citadel Software Engineer Interview Questions
Quoted word for word from Citadel interview reports.
“Given run-length encoded sequences from multiple channels where sequence numbers might be slightly off (within 10 of the true position), uncompress them, and then compress them again.”
Read reports →“What is the minimum number of knight moves required on an nxn chessboard to go from coordinates (a,b) to (c,d)?”
Read reports →“Given a dictionary of words and a matrix of characters, find all words that exist in the matrix. Each word must be constructed from letters of sequentially adjacent cells, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once in a word. The solution should use a Trie data structure.”
Read reports →“What is the minimum number of moves for a knight to reach a target square from a given starting position on an nxn chessboard, where n is provided as input?”
Read reports →“Find the number of triplets from the set [a, b, c, d, e] that sum up to t or less.”
Read report →“Given an array of heights representing hills, find the maximum area of water that can be trapped in the valleys.”
Read report →“What are the number of ways to get from the top-left to the bottom-right corner of an 8x8 chessboard, moving up, down, left, or right?”
Read report →“How many pairs of indices (i, j) satisfy the condition v[i] = v[j] = sum of elements from v[i+1] to v[j-1]? Aim for an O(n log n) solution.”
Read report →“For a given integer n, how many distinct ways can you express n as a sum of consecutive positive integers?”
Read report →Formats, difficulty and experience
Across all 407 Citadel interview reports.