Interview questions
1,322 questions in the style trading and research firms ask, from probability and brainteasers to options, statistics and coding. Every question is open to read, with its hints. The 50 in the free sample can be answered and marked on the spot, no account needed; open 3 of their worked solutions to try, then all of them with a free account.
55 questions · page 1 of 2 · Clear filters
Random question- 01A root-finding guarantee, part 1 of 3
FoundationData structures and algorithms
- 02You need the 100 largest values from a stream of 10⁹ numbers you cannot store.
FoundationData structures and algorithmsCitadel SecuritiesHudson River TradingJump TradingFree solution
- 03How many comparisons does a binary search need, in the worst case, over a…
FoundationData structures and algorithmsOptiverHudson River TradingJump Trading
- 04A balanced binary search tree holds one million keys.
FoundationData structures and algorithmsOptiverCitadel SecuritiesHudson River Trading
- 05What is the maximum number of edges in a directed acyclic graph on ten vertices?
FoundationData structures and algorithmsCitadel SecuritiesHudson River TradingJump Trading
- 06How many set bits does the integer 90 have?
FoundationData structures and algorithmsCitadel SecuritiesHudson River TradingJump Trading
- 07How many non-empty contiguous subarrays does an array of length ten have?
FoundationData structures and algorithmsCitadel SecuritiesHudson River TradingJump Trading
- 08How many times does the inner body run in for i in range(1000): for j in range(i): body()?
FoundationData structures and algorithmsCitadelHudson River Trading
- 09What is the height (edges on the longest root-to-leaf path) of a binary heap…
FoundationData structures and algorithmsCitadelHudson River Trading
- 10A dependency graph has edges a → b, a → c, b → d, c → d.
FoundationData structures and algorithmsCitadelHudson River Trading
- 11You climb a staircase of 10 steps, taking one or two steps at a time.
FoundationData structures and algorithmsOptiverCitadelHudson River Trading
- 12For a positive integer x, which test is true exactly when x is a power of two?
FoundationData structures and algorithmsHudson River TradingJump Trading
- 13Searching a sorted array, part 1 of 3
FoundationData structures and algorithms
- 14Converting between currencies, part 1 of 3
FoundationData structures and algorithms
- 15Climbing a staircase, part 1 of 3
FoundationData structures and algorithms
- 16Finding the unpaired ids, part 1 of 3
FoundationData structures and algorithms
- 17A root-finding guarantee, part 2 of 3
AppliedData structures and algorithms
- 18What does the recurrence T(n) = 2T(n/2)+O(n) solve to?
AppliedData structures and algorithmsOptiverHudson River TradingJump TradingFree solution
- 19A hot-path buffer is a dynamic array with O(1) amortised push.
AppliedData structures and algorithmsHudson River TradingJump Trading
- 20Using an unlimited supply of coins worth 1, 3 and 4, in how many ways can you…
AppliedData structures and algorithmsCitadel SecuritiesHudson River TradingJump Trading
- 21When does a hash map lookup degrade to linear time?
AppliedData structures and algorithmsCitadel SecuritiesHudson River TradingJump Trading
- 22What is the expected number of fair coin flips to see two heads in a row?
AppliedData structures and algorithmsJane StreetOptiverSIG (Susquehanna)
- 23Your shortest-path graph has some negative edge weights but no negative cycles.
AppliedData structures and algorithmsOptiverCitadel SecuritiesHudson River Trading
- 24How many iterations does the loop while (x) { x &= x - 1; n++; } make on x = 255?
AppliedData structures and algorithmsOptiverCitadel SecuritiesHudson River Trading
- 25What is the edit distance between "kitten" and "sitting"?
AppliedData structures and algorithmsOptiverCitadel SecuritiesHudson River Trading
- 26What most often decides whether a dynamic programming solution is feasible?
AppliedData structures and algorithmsCitadel SecuritiesHudson River TradingJump Trading
- 27What does the recurrence T(n) = 4T(n/2)+Θ(n²) solve to?
AppliedData structures and algorithmsJane StreetCitadelHudson River Trading
- 28A dynamic array starts with capacity 1 and doubles when full, copying all elements.
AppliedData structures and algorithmsCitadelHudson River TradingJump Trading
- 29You insert 1,000 keys into a hash table with 1,000 buckets using a uniform hash.
AppliedData structures and algorithmsJane StreetCitadelHudson River Trading
- 30You implement a queue with two stacks: push onto the inbox, and pop from the…
AppliedData structures and algorithmsCitadelHudson River TradingJump Trading
- 31How many structurally different binary search trees can hold the keys 1,2,3,4,5?
AppliedData structures and algorithmsJane StreetCitadelHudson River Trading
- 32What is the running time of Dijkstra’s algorithm with a binary heap, on a graph…
AppliedData structures and algorithmsCitadelHudson River TradingJump Trading
- 33A graph has edges A–B (weight 1), B–C (2), A–C (3), C–D (4) and B–D (5).
AppliedData structures and algorithmsCitadelHudson River Trading
- 34What is the largest sum of a contiguous subarray of [−2,1,−3,4,−1,2,1,−5,4]?
AppliedData structures and algorithmsJane StreetCitadelHudson River Trading
- 35What is the length of the longest substring of "abcabcbb" with no repeated characters?
AppliedData structures and algorithmsCitadelHudson River Trading
- 36What is the length of the longest strictly increasing subsequence of…
AppliedData structures and algorithmsJane StreetCitadelHudson River Trading
- 37Items have weights 1,3,4,5 and values 1,4,5,7.
AppliedData structures and algorithmsJane StreetCitadelHudson River Trading
- 38With coins of 1, 5, 6 and 9, what is the fewest coins that make 11?
AppliedData structures and algorithmsOptiverCitadelHudson River Trading
- 39What is 1oplus2oplus3oplus⋯oplus10, where oplus is bitwise XOR?
AppliedData structures and algorithmsCitadelHudson River TradingJump Trading
- 40Computing x¹³ by binary exponentiation (repeated squaring), how many…
AppliedData structures and algorithmsCitadelHudson River TradingJump Trading