Derivatives Foundation interview preparation
The full derivatives syllabus from no-arbitrage pricing through the Greeks, the volatility surface, swaps, CDS and clearing, plus the Indian index-options market. Every question is either traced to a named firm from a public candidate report, or tagged at desk level when we could not trace it - we do not invent attributions.
100 questions, mapped to the firms that asked them
- Questions
- 100
- Traced to a firm
- 29
- Firms
- 19
- Updated
- September 2026
088Compute the probability and then bet on whether you draw another black stone.CitadelQuantitative Trading · New York · 2025
Say this
Two parts, and the second is the real test. Compute the conditional probability by Bayes, updating on what has already been drawn, then price a bet at odds that give you an edge and size it so a wrong answer does not end you. Most candidates get the arithmetic and then bet like the arithmetic is certain.
Then walk it
- Set up the inference properly. If the composition of the bag is unknown, drawing a black stone is evidence about the composition, so you update over the possible bags rather than treating the draw as independent.
- The classic version: two urns, or a bag with an unknown mix, and a black draw raises the posterior weight on black-heavy compositions. With no replacement, conditioning on the draws already made is essential — a common error is to compute the unconditional probability and hand it over.
- Worked case to show the mechanism: three stones, one known black, one known white, one unknown with equal odds. You draw black. Posterior probability the unknown is black rises to two thirds, so the next draw being black is now more likely than the prior suggested. That is the Bayes step they are checking.
- Then the betting step, which is where the interview is decided. If my computed probability is 0.6, I want odds better than 3 to 2 to have an edge. I would quote a market rather than accept theirs — say I am a buyer at 55 and a seller at 65 — because that is the trading answer rather than the maths answer.
- Then sizing. Kelly says stake a fraction equal to the edge over the odds, and in an interview I would bet a small multiple less than Kelly, because my probability estimate is itself uncertain and Kelly assumes it is not.
- And I would say the honest caveat: my probability depends on my prior over the bag's composition, and if I have the prior wrong my edge is imaginary. So I would take the bet at odds that leave room for my model being wrong, which means demanding better than fair odds rather than exactly fair ones.
Where candidates lose it
Computing the probability and then accepting whatever odds are offered. Citadel is watching whether you distinguish your estimate from your confidence in it, quote a two-way market, and size below Kelly because the input is uncertain. The maths is the easy half.
Expect next
- What is your prior over the bag's composition, and how much does the answer depend on it?
- What odds do you need to take the bet?
- How much would you stake, and why not more?
Reported by candidates at Citadel (Quantitative Trading, New York, 2025). Source: Wall Street Oasis.
089There are n cars on a circular track and between them just enough petrol for one car to complete a lap. Show that there is a car that can complete the lap by collecting petrol from the others as it goes.Millennium ManagementInvestments · London · 2024
Say this
Yes, such a car always exists. The cleanest proof: imagine a phantom car with enough fuel to complete the lap anyway, start it anywhere, and track its fuel level as it picks up each deposit. The point at which its fuel is at its minimum is a valid starting car — from there the cumulative balance never goes negative.
Then walk it
- Set it up as a sequence of partial sums. Going around the circle, each car contributes a gain of its petrol and each gap costs fuel. Total gains minus total costs is exactly zero, because there is precisely one lap's worth.
- The argument: define the running balance starting from an arbitrary car. It ends at zero. Take the position where the running balance is at its global minimum, and start there instead. Relative to that point, every partial sum is non-negative, because you subtracted the most negative value from all of them.
- So the starting car is the one immediately after the minimum of the cumulative balance. That is a constructive answer, not just an existence proof, which is what makes it satisfying.
- There is an induction proof too: with n cars, there must exist some car that has enough petrol to reach the next one — otherwise the total would be insufficient. Merge those two into a single car and you have the same problem with n minus 1. Induct down to one car, which trivially works.
- One line for n equals 2 to show the mechanism: if car A has 0.7 laps of fuel and B has 0.3, and the gap from A to B is 0.4, then A cannot reach B directly if it only had 0.3 — the partial-sum argument tells you which one to pick without checking cases.
- Why this gets asked at a fund rather than in a maths class: it is the same structure as a cash flow or margin problem. You know the total is sufficient and you need to know whether the path ever goes negative. That is exactly a funding liquidity question, and the answer is always about the minimum of the cumulative balance, not the total.
Where candidates lose it
Trying small cases and asserting a pattern. The interviewer wants the partial-sum or induction argument. And the move that impresses is connecting it to cash flow timing — total sufficiency does not imply path feasibility, which is the whole of liquidity risk.
Expect next
- Give me the induction version of the proof.
- Is the starting car unique?
- What financial problem has exactly this structure?
Reported by candidates at Millennium Management (Investments, London, 2024). Source: Wall Street Oasis.
Firm tags come from public, anonymous candidate reports on Wall Street Oasis: strong signal, not sworn testimony. Firms are named as the places a question was reported, not as partners of Fin Maverick. Answers are written for this page to show how to think out loud; they are not scripts to recite.

