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.
1,322 questions · page 29 of 34
Random question- 1121Converting between currencies, part 1 of 3
FoundationData structures and algorithms
- 1122Climbing a staircase, part 1 of 3
FoundationData structures and algorithms
- 1123Finding the unpaired ids, part 1 of 3
FoundationData structures and algorithms
- 1124A root-finding guarantee, part 2 of 3
AppliedData structures and algorithms
- 1125What does the recurrence T(n) = 2T(n/2)+O(n) solve to?
AppliedData structures and algorithmsOptiverHudson River TradingJump TradingFree solution
- 1126A hot-path buffer is a dynamic array with O(1) amortised push.
AppliedData structures and algorithmsHudson River TradingJump Trading
- 1127Using an unlimited supply of coins worth 1, 3 and 4, in how many ways can you…
AppliedData structures and algorithmsCitadel SecuritiesHudson River TradingJump Trading
- 1128When does a hash map lookup degrade to linear time?
AppliedData structures and algorithmsCitadel SecuritiesHudson River TradingJump Trading
- 1129What is the expected number of fair coin flips to see two heads in a row?
AppliedData structures and algorithmsJane StreetOptiverSIG (Susquehanna)
- 1130Your shortest-path graph has some negative edge weights but no negative cycles.
AppliedData structures and algorithmsOptiverCitadel SecuritiesHudson River Trading
- 1131How many iterations does the loop while (x) { x &= x - 1; n++; } make on x = 255?
AppliedData structures and algorithmsOptiverCitadel SecuritiesHudson River Trading
- 1132What is the edit distance between "kitten" and "sitting"?
AppliedData structures and algorithmsOptiverCitadel SecuritiesHudson River Trading
- 1133What most often decides whether a dynamic programming solution is feasible?
AppliedData structures and algorithmsCitadel SecuritiesHudson River TradingJump Trading
- 1134What does the recurrence T(n) = 4T(n/2)+Θ(n²) solve to?
AppliedData structures and algorithmsJane StreetCitadelHudson River Trading
- 1135A dynamic array starts with capacity 1 and doubles when full, copying all elements.
AppliedData structures and algorithmsCitadelHudson River TradingJump Trading
- 1136You insert 1,000 keys into a hash table with 1,000 buckets using a uniform hash.
AppliedData structures and algorithmsJane StreetCitadelHudson River Trading
- 1137You implement a queue with two stacks: push onto the inbox, and pop from the…
AppliedData structures and algorithmsCitadelHudson River TradingJump Trading
- 1138How many structurally different binary search trees can hold the keys 1,2,3,4,5?
AppliedData structures and algorithmsJane StreetCitadelHudson River Trading
- 1139What is the running time of Dijkstra’s algorithm with a binary heap, on a graph…
AppliedData structures and algorithmsCitadelHudson River TradingJump Trading
- 1140A 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
- 1141What 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
- 1142What is the length of the longest substring of "abcabcbb" with no repeated characters?
AppliedData structures and algorithmsCitadelHudson River Trading
- 1143What is the length of the longest strictly increasing subsequence of…
AppliedData structures and algorithmsJane StreetCitadelHudson River Trading
- 1144Items have weights 1,3,4,5 and values 1,4,5,7.
AppliedData structures and algorithmsJane StreetCitadelHudson River Trading
- 1145With coins of 1, 5, 6 and 9, what is the fewest coins that make 11?
AppliedData structures and algorithmsOptiverCitadelHudson River Trading
- 1146What is 1oplus2oplus3oplus⋯oplus10, where oplus is bitwise XOR?
AppliedData structures and algorithmsCitadelHudson River TradingJump Trading
- 1147Computing x¹³ by binary exponentiation (repeated squaring), how many…
AppliedData structures and algorithmsCitadelHudson River TradingJump Trading
- 1148Searching a sorted array, part 2 of 3
AppliedData structures and algorithms
- 1149Converting between currencies, part 2 of 3
AppliedData structures and algorithms
- 1150Climbing a staircase, part 2 of 3
AppliedData structures and algorithms
- 1151Finding the unpaired ids, part 2 of 3
AppliedData structures and algorithms
- 1152A root-finding guarantee, part 3 of 3
AdvancedData structures and algorithms
- 1153You roll a fair six-sided die up to three times, stopping whenever you like and…
AdvancedData structures and algorithmsJane StreetOptiverSIG (Susquehanna)
- 1154You need prefix sums with point updates on a large array. Fenwick tree or segment tree?
AdvancedData structures and algorithmsCitadel SecuritiesHudson River TradingJump Trading
- 1155Strassen’s matrix multiplication satisfies T(n) = 7T(n/2)+O(n²).
AdvancedData structures and algorithmsCitadel SecuritiesTwo SigmaHudson River Trading
- 1156With both union by rank and path compression, what is the amortised cost of a…
AdvancedData structures and algorithmsJane StreetCitadelHudson River Trading
- 1157Parcels weighing 1,2,…,10 must ship in order within 5 days, each day’s load…
AdvancedData structures and algorithmsCitadelHudson River TradingJump Trading
- 1158Any comparison sort must, in the worst case, make at least ⌈log₂n!⌉ comparisons.
AdvancedData structures and algorithmsJane StreetCitadelHudson River Trading
- 1159Searching a sorted array, part 3 of 3
AdvancedData structures and algorithms
- 1160Climbing a staircase, part 3 of 3
AdvancedData structures and algorithms