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 32 of 34
Random question- 1241A quadratic passes through (0,1), (1,3) and (2,7). What is its value at x = 1.5?
AppliedNumerical methodsCitadelTwo Sigma
- 1242Estimate ∫₀¹x³ dx with Simpson’s rule on two equal intervals.
AppliedNumerical methodsCitadelTwo Sigma
- 1243For a smooth function, how does the error of the midpoint rule compare with…
AppliedNumerical methodsCitadelTwo Sigma
- 1244You solve Ax = b in double precision (about 16 significant digits) and A has…
AppliedNumerical methodsCitadelTwo SigmaHudson River Trading
- 1245Why does Gaussian elimination use partial pivoting?
AppliedNumerical methodsCitadelTwo Sigma
- 1246An explicit scheme for the advection equation uₜ+2uₓ = 0 uses Δx = 0.01.
AppliedNumerical methodsCitadelTwo Sigma
- 1247In double precision, what does 1 - math.cos(1e-8) evaluate to?
AppliedNumerical methodsCitadelTwo SigmaHudson River Trading
- 1248Double precision can represent every integer up to 2ᵏ exactly, but not every…
AppliedNumerical methodsCitadelHudson River TradingJump Trading
- 1249A loop total = 0.0; for _ in range(10): total += 0.1 leaves total == 0.9999999999999999.
AppliedNumerical methodsCitadelTwo SigmaHudson River Trading
- 1250Stepping the heat equation, part 2 of 3
AppliedNumerical methods
- 1251Newton’s method for a square root, part 2 of 3
AppliedNumerical methods
- 1252Integrating an exponential, part 2 of 3
AppliedNumerical methods
- 1253Where doubles run out of digits, part 2 of 3
AppliedNumerical methods
- 1254Your implied-volatility solver uses pure Newton–Raphson. Which input breaks it?
AdvancedNumerical methodsOptiverIMC TradingJump Trading
- 1255You need x = A⁻¹b. Why does production code not compute the inverse?
AdvancedNumerical methodsCitadelTwo SigmaHudson River Trading
- 1256Computing a variance as 𝔼[X²]−(𝔼[X])² sometimes returns a small negative number. Why?
AdvancedNumerical methodsTwo SigmaHudson River TradingJump Trading
- 1257What is the order of convergence of the secant method, to three decimal places?
AdvancedNumerical methodsCitadel SecuritiesHudson River TradingJump Trading
- 1258An explicit scheme for the heat equation with unit diffusion requires Δt ≤ Δx²/2.
AdvancedNumerical methodsCitadel SecuritiesHudson River TradingJump Trading
- 1259You sum ten million small positive numbers in float32. What goes wrong and what fixes it?
AdvancedNumerical methodsCitadel SecuritiesTwo SigmaHudson River Trading
- 1260Linear interpolation of eˣ on an interval of width h = 0.1 starting at 0 has…
AdvancedNumerical methodsCitadelTwo Sigma
- 1261You interpolate a discount curve linearly in the logarithm of the discount factors.
AdvancedNumerical methodsJane StreetCitadelDRW
- 1262Trapezoid estimates of ∫₀¹x² dx are 0.375 with step h and 0.34375 with step h/2.
AdvancedNumerical methodsJane StreetCitadelTwo Sigma
- 1263Newton’s method for a square root, part 3 of 3
AdvancedNumerical methods
- 1264Integrating an exponential, part 3 of 3
AdvancedNumerical methods
- 1265Where doubles run out of digits, part 3 of 3
AdvancedNumerical methods
- 1266Stepping the heat equation, part 3 of 3
ExpertNumerical methods
- 1267A busy matching engine, part 1 of 3
FoundationSystems and low latency
- 1268An L1 cache reference costs about 1 ns and a main-memory reference about 100 ns.
FoundationSystems and low latencyCitadel SecuritiesHudson River TradingJump TradingFree solution
- 1269AVX-512 registers are 512 bits wide. How many float64 values does one hold?
FoundationSystems and low latencyCitadel SecuritiesHudson River TradingJump Trading
- 1270A cache line is 64 bytes. How many 32-bit integers fit in one?
FoundationSystems and low latencyCitadel SecuritiesHudson River TradingJump Trading
- 1271A single scan reads 1 GB from main memory at a sustained 20 GB/s.
FoundationSystems and low latencyCitadelHudson River TradingJump Trading
- 1272A ring buffer has capacity 1024 and wraps its index with a bit mask instead of a modulo.
FoundationSystems and low latencyHudson River TradingJump Trading
- 1273A multicast feed delivers packets with sequence numbers 1001, 1002 and then 1005.
FoundationSystems and low latencyCitadel SecuritiesHudson River TradingJump Trading
- 1274You sort 1,000 latency samples in ascending order.
FoundationSystems and low latencyCitadelHudson River TradingJump Trading
- 1275A timestamp counter ticks at 3 GHz. How many ticks elapse in one microsecond?
FoundationSystems and low latencyHudson River TradingJump Trading
- 1276An array-based book pre-allocates one slot per price tick.
FoundationSystems and low latencyCitadel SecuritiesHudson River TradingJump Trading
- 1277You join a price level behind 800 shares.
FoundationSystems and low latencyOptiverCitadel SecuritiesHudson River Trading
- 1278Designing an order book, part 1 of 3
FoundationSystems and low latency
- 1279A burst on the feed, part 1 of 4
FoundationSystems and low latency
- 1280Walking a matrix through the cache, part 1 of 3
FoundationSystems and low latency