Guide · Jane Street
Jane Street interview questions and how to prepare
30 problems · 8 min read · updated 2026-09-07
Jane Street interviews are famous for two things: they are conversational, and they never stop at the first answer. A probability question becomes a betting game, the betting game gets a twist, and the twist becomes a market you have to quote. The firm is testing whether your reasoning survives contact with a changing problem — which is what its trading actually is.
The questions below are the recurring ones, grouped by round type. Each has a full worked solution and, more importantly, a follow-up you should expect.
Probability under discussion
Jane Street probability is asked slowly and with follow-ups. Expect to be asked why your answer is intuitive, what changes if the coin is biased, and whether you would bet on it at given odds. The classics below all have that second question built in.
A fair coin is tossed twice. Given that at least one toss is heads, what is the probability that both are heads?
Answer: 1/3 · Worked solution →
100 passengers board a full 100-seat plane. The first passenger lost their ticket and sits in a uniformly random seat. Each later passenger takes their own seat if free, else a random free seat. What is the probability the 100th passenger sits in their own seat?
Answer: 1/2 · Worked solution →
A stick is broken at two independent, uniformly random points. What is the probability the three pieces can form a triangle?
Answer: 1/4 · Worked solution →
Two independent Uniform(0, 1) random variables are drawn. What is the expected value of the larger one?
Answer: 2/3 · Worked solution →
n people throw their hats into a pile and each takes one back at random. What is the expected number of people who get their own hat?
Answer: 1 · Worked solution →
A family has two children. You learn that at least one of them is a boy born on a Tuesday (assume boys and girls, and all birth days, are equally likely and independent). What is the probability that both children are boys?
Answer: 13/27 · Worked solution →
100 prisoners’ numbers are placed randomly in 100 boxes, one per box. Each prisoner may open at most 50 boxes, looking for their own number; all must succeed or all die, and they cannot communicate once the search begins. With the optimal strategy (each prisoner starts at their own box and follows the number found to the next box), what is the probability that every prisoner finds their number? Answer to two decimals.
Answer: 0.31 · Worked solution →
Betting games and market making
The signature Jane Street round. You will be offered a game and asked what you would pay for it, then asked to make a market on it, then traded against. Backward induction and honest updating are the whole skill.
You roll a fair die and are paid its face value in dollars, but you may re-roll up to two times, keeping only the final roll. Playing optimally, what is this game worth?
Answer: 4.67 · Worked solution →
Cards from a shuffled standard 52-card deck are revealed one at a time. Your running total gains 1 for every black card. You may stop whenever you like and collect the running total (you may also stop immediately at $0). Playing optimally, what is this game worth?
Answer: 2.62 · Worked solution →
Everyone in a large group simultaneously picks a number from 0 to 100. The winner is whoever is closest to two-thirds of the group average. If every player is perfectly rational and knows everyone else is too, what number does game theory say everyone picks?
Answer: 0 · Worked solution →
Two bidders compete in a sealed-bid first-price auction. Each privately values the item as an independent uniform draw on [0, 1], and the higher bid wins and pays its own bid. In the symmetric equilibrium each bidder bids half their value. Your value is 0.8 — what do you bid?
Answer: 0.4 · Worked solution →
A pot starts at $2 and doubles after every heads; the game ends at the first tails and pays the pot. In dollars, what is the expected payout of this game?
Two envelopes hold money, one exactly twice the other. You pick one, open it, and see 50 or 125 — always switch!” The same argument applies before opening ANY envelope, implying you should switch forever. Where exactly does the argument break?
Random walks and stopping times
Expected time until a pattern, ruin probabilities, ballot-style path counting. These bridge the probability round and the trading round and are asked of both traders and researchers.
What is the expected number of fair-coin flips to get two heads in a row (HH)?
Answer: 6 · Worked solution →
What is the expected number of fair-coin flips to first see the pattern H-T-H?
Answer: 10 · Worked solution →
You start with 1 on a fair coin each round, stopping when you reach 100. What is the probability you reach $100 before going broke?
Answer: 0.3 · Worked solution →
In an election, candidate A receives 60 votes and candidate B receives 40. The ballots are counted one at a time in uniformly random order. What is the probability that A is strictly ahead throughout the entire count?
Answer: 0.2 · Worked solution →
A symmetric random walk starts at 3 and stops when it hits 0 or 10 (each step ±1, equally likely). What is the expected number of steps until it stops?
Answer: 21 · Worked solution →
Math and coding
Calculus with a twist and a light coding round for trader candidates; a heavier one for researchers and developers. Sampling problems — rand10 from rand7 — are the recurring favourite.
What value of x > 0 maximizes ? (Enter a decimal.)
Answer: 2.71828 · Worked solution →
What is the derivative of evaluated at ?
Answer: 1 · Worked solution →
How to approach these in the interview
Expect the follow-up and pre-empt it. After every answer, offer the natural twist yourself: "if the coin were biased, this becomes…". Jane Street interviewers are steering toward that anyway, and arriving first is the strongest signal you can send.
Bet on your answers. Interviewers frequently ask whether you would take a bet at some odds. Say a number, explain the edge, and size it. Refusing to bet on your own analysis is read as not believing it.
Slow is fine; silent is not. Jane Street is unusually tolerant of thinking time as long as you narrate it. "I am going to try the two-pirate case" is a perfectly good sentence to say out loud.
Prepare the Quant 75 plus the market-making set. Nearly every recurring Jane Street question is in one of those two lists; the Trader track orders them for exactly this interview.
Frequently asked
How many rounds does the Jane Street quant interview have?
Typically a phone screen with probability and a brain teaser, one or two technical phone rounds that add betting games and market making, then an on-site (or virtual on-site) day of several back-to-back rounds with different traders, often including a mock trading game. Researchers and developers get a coding round in place of some of the trading rounds.
Does Jane Street ask brain teasers?
Yes, mostly early in the process, and they favour deduction and backward-induction puzzles (pirates, poisoned wine, weighing problems) over pure lateral-thinking riddles.
What math background does Jane Street expect?
Fluent undergraduate probability and calculus, comfort with expected value and conditioning under time pressure, and for research roles some exposure to stochastic processes and statistics. Depth of reasoning matters more than breadth of syllabus.
Is the Jane Street interview harder than Optiver or SIG?
Different rather than harder. Optiver emphasises speed and mental arithmetic; SIG emphasises poker-style decision making; Jane Street emphasises depth and follow-ups on a smaller number of questions.
Practise these with answer checking and spaced review
All 188 problems, full worked solutions, and a review queue that brings each one back before you forget it. Free.
Get started freeRelated guides