Wincent interview questions

How Wincent's process runs, as candidates and the firm describe it, and the questions candidates report, each with a worked solution. Free, no sign-up.

Practise these in the app Mock interview

How Wincent interviews

Sources: Wincent: Quantitative Research Internship (official) · Wincent: Internship experience (official) · Glassdoor: Wincent interviews · QuantVault: Wincent online assessment

Questions (11)

Try each one before opening the solution. Interviewers change the numbers, so learn the method.

Quant researcher · Interview · Probability · reported by a candidate

Table tennis: the score is 10–10, so you need to win by two points. You win each point with probability 40%, independently.

  1. (a) What is the probability that you win the game?
    Answer and worked solution

    Answer: 4/13 ≈ 0.30769

    Key idea. At 10–10 you need two points in a row; a split returns you to 10–10. So look at pairs of points.

    1. Win–win: 0.4² = 0.16, you win. Lose–lose: 0.6² = 0.36, you lose. Split: 0.48, back to deuce.
    2. Ignore the splits: P(win) = 0.16/(0.16 + 0.36) = 16/52.
    3. = 4/13 ≈ 0.308.

    Check. Below 0.4: the deuce rule amplifies the stronger player's edge, and here that's your opponent.

  2. (b) Follow-up (ours): how many more points are played, on average?
    Answer and worked solution

    Answer: 50/13 ≈ 3.8462

    Key idea. Each pair of points ends the game with a fixed probability, so the number of pairs is geometric.

    1. A pair ends the game with probability 0.16 + 0.36 = 0.52.
    2. Expected pairs = 1/0.52.
    3. Expected points = 2/0.52 ≈ 3.85.

    Check. At least 2 points are always needed, and long rallies of splits are fairly rare.

Interviewers may push further: What if you win each point on your own serve with probability 0.5 and on theirs with 0.3, alternating serves every point? At what point-win probability is your chance of winning from deuce exactly 1/3?

Source: Glassdoor: Wincent interviews · Try it in the app →

Quant trading intern · Interview · Expected value · reported by a candidate

Threes: roll five dice. Threes count as zero; other faces count at face value; you want the lowest total. After each roll you must keep at least one die (kept dice add to your score) and re-roll the rest. Play optimally.

A candidate reports being asked "a very tricky variant" of the game of Threes from Matthew Conroy's A Collection of Dice Problems (problem 56). The variant itself isn't public, so practise the original until the backward-induction method is automatic.

  1. (a) With one die left to roll, what is your expected score from it?
    Answer and worked solution

    Answer: 3

    Key idea. With one die you just take whatever comes up.

    1. Face values: 1, 2, 0 (a three), 4, 5, 6.
    2. Average: 18/6 = 3.
  2. (b) With two dice left, what is your expected score under optimal play?
    Answer and worked solution

    Answer: 79/18 ≈ 4.3889

    Key idea. You must keep the lower die. Keep the other too only if it beats re-rolling, which is worth 3.

    1. Keep the higher die only if it shows 0 (a three), 1 or 2; otherwise re-roll it for an expected 3.
    2. Your score is min + min(other, 3), with threes counted as 0.
    3. Averaging over all 36 rolls gives 158/36.
    4. = 79/18 ≈ 4.39.

    Check. Always keeping both would average 6; the re-roll option saves a lot.

  3. (c) Follow-up (from Conroy's solution): the expected score of the full five-dice game under optimal play?
    Answer and worked solution

    Answer: 6.254

    Key idea. Backward induction: the value with n dice uses the values with fewer dice.

    1. E₁ = 3, E₂ = 79/18 ≈ 4.389.
    2. With n dice: keep the lowest, then keep the next-lowest dice only while their total beats the value of re-rolling the rest.
    3. This gives E₃ ≈ 5.234 and E₄ ≈ 5.834.
    4. And E₅ ≈ 6.254.

    Check. Each extra die adds less and less, because you only keep cheap dice.

    Trap. Keeping every 2. With three dice, a 2 is worth keeping next to another 2 but not next to a 4.

Interviewers may push further: Why must the optimal strategy keep the lowest dice first? How does the answer change if you may keep zero dice on a roll (but still at most five rolls)?

Source: Glassdoor: Wincent interviews · Try it in the app →

Quant trader · Interview · Optimal stopping · reported by a candidate

A hat holds 100 one-dollar bills, 10 ten-dollar bills and one hundred-dollar bill. Bills are drawn one at a time at random, without replacement, and you see each one. At any moment (including before the first draw) you may say "stop": the next bill drawn is yours.

  1. With the best strategy, what is the game worth (in dollars)?
    Answer and worked solution

    Answer: 100/37 ≈ 2.7027

    Key idea. The amount you'd win by stopping now is the average of the bills left. That average is a martingale.

    1. If you stop, the next bill is a random one of those left, so you expect the current average.
    2. After a draw, the expected new average equals the current average (whatever comes out, the rest reweights exactly).
    3. So no stopping rule can change your expected winnings: every strategy is worth the same as stopping immediately.
    4. Value = (100 × 1 + 10 × 10 + 100)/111 = 300/111 ≈ $2.70.

    Check. Try "wait for the $100 to come out, then stop": sometimes the average rises, sometimes it falls, and it balances exactly.

    Trap. Waiting for small bills to clear "to improve the odds". It improves some paths and ruins others equally.

Interviewers may push further: Does the answer change if you must stop before the hat is empty? (No.) What if you can see the bills but the payout is the bill drawn two after you stop?

Source: Glassdoor: Wincent quant trader (second round) · Try it in the app →

Quant trading intern · Interview · Expected value · reported by a candidate

You roll a fair die repeatedly, keeping a running total, until the total exceeds 100.

Reported as an expected value "you have to estimate" when dice rolls add up past 100. We ask for both the final total and the number of rolls.

  1. (a) Estimate the expected final total.
    Answer and worked solution

    Answer: 308/3 ≈ 102.67

    Key idea. The final total is 100 plus the overshoot. Large rolls are more likely to be the one that crosses.

    1. Renewal theory: the expected overshoot is E[X(X + 1)]/(2E[X]) for a die roll X.
    2. E[X²] = 91/6 and E[X] = 21/6, so E[X(X + 1)] = 112/6.
    3. Overshoot = (112/6)/7 = 8/3 ≈ 2.67.
    4. Final total ≈ 100 + 2.67 = 102.67.

    Check. The overshoot is between 1 and 6, and closer to the bottom of that range than the top.

    Trap. Guessing 100 + 3.5. The crossing roll isn't a typical roll: it's biased towards larger values (the length-biasing effect).

  2. (b) The expected number of rolls?
    Answer and worked solution

    Answer: 88/3 ≈ 29.333

    Key idea. Wald's identity links total and number of rolls: E[total] = E[rolls] × E[one roll].

    1. E[rolls] = 102.67/3.5.
    2. ≈ 29.33.

    Check. About 100/3.5 ≈ 28.6, plus a little for the overshoot.

Interviewers may push further: What is the most likely final total? What if you stop at or above 100 instead?

Source: Glassdoor: Wincent quant trading intern (45-minute interview) · Try it in the app →

Quant trading intern · Online test · Probability · reported by a candidate

A stick is broken at two points chosen uniformly at random.

  1. What is the probability that the three pieces can form a triangle?
    Answer and worked solution

    Answer: 0.25

    Key idea. Three pieces make a triangle exactly when every piece is shorter than half the stick.

    1. Let the breaks be at x and y, uniform on [0, 1], with the square of (x, y) as the sample space.
    2. With x < y the pieces are x, y − x, 1 − y. All below ½ means x < ½, y > ½, y − x < ½.
    3. That's a triangle of area 1/8. By symmetry the case y < x gives another 1/8.
    4. P = 1/4.

    Check. Most breaks leave one long piece, so the answer should be well below ½.

    Trap. Breaking at one point, then breaking the longer piece: that's a different question, with answer 2 ln 2 − 1 ≈ 0.386.

Interviewers may push further: What if you break the stick once, then break the longer piece at a random point?

Source: Glassdoor: Wincent interviews, page 2 (quant trading intern, online test, 2026) · Try it in the app →

Quant trading intern · Interview · Estimation · reported by a candidate

Without a computer, estimate how many prime numbers there are below 1,000,000.

Reported as "counting how many prime numbers are in a large range". The range here is ours; the estimating method is the point.

  1. Your estimate (within 10% counts)?
    Answer and worked solution

    Answer: 78498

    Key idea. The prime number theorem: near x, about one number in ln x is prime.

    1. π(x) ≈ x/ln x.
    2. ln(10⁶) = 6 ln 10 ≈ 6 × 2.303 ≈ 13.8.
    3. x/ln x ≈ 72,000, but this underestimates. x/(ln x − 1) ≈ 10⁶/12.8 ≈ 78,000.
    4. The true count is 78,498.

    Check. Check density: below 100 there are 25 primes (1 in 4); near a million, 1 in 13.8 is about right.

Interviewers may push further: Roughly how many primes are there between 1,000,000 and 1,001,000? Why is x/(ln x − 1) a better estimate than x/ln x?

Source: Glassdoor: Wincent interviews, page 2 (quant trading intern, 30-minute interview, 2026) · Try it in the app →

Quant intern · Online test · Markov chains · reported by a candidate

A bug walks on the corners of a cube. Each second it moves along one of the three edges from its corner, chosen at random.

Reported only as "the standard question with an ant on a cube", so the wording here is ours.

  1. (a) Expected number of moves to reach the opposite corner?
    Answer and worked solution

    Answer: 10

    Key idea. Group corners by distance from the target and solve for the expected time from each distance.

    1. From distance 3 you always move to 2. From 2: to 1 with probability 2/3, back to 3 with 1/3. From 1: finish with 1/3, back to 2 with 2/3.
    2. h₃ = 1 + h₂; h₂ = 1 + ⅔h₁ + ⅓h₃; h₁ = 1 + ⅔h₂.
    3. Substituting gives h₁ = 7, h₂ = 9.
    4. h₃ = 10.

    Check. At least 3 moves are needed; random wandering makes it about three times that.

  2. (b) Expected number of moves to return to the starting corner?
    Answer and worked solution

    Answer: 8

    Key idea. For a random walk on a symmetric graph, the expected return time to a vertex is 1/(its long-run share of time).

    1. By symmetry every corner gets the same share of time: 1/8.
    2. Expected return time = 8.

    Check. This is Kac's lemma. It's much quicker than setting up the equations again.

Interviewers may push further: What about a random walk on the 16 corners of a 4-dimensional cube to the opposite corner?

Source: Glassdoor: Wincent quant intern ("standard question with ant on cube") · Try it in the app →

Quant (online test topic) · Online test · Probability · practice question on a reported topic

A cell, each minute, dies with probability 1/4, stays a single cell with probability 1/4, or splits into two with probability 1/2. Every cell behaves independently. You start with one cell.

Practice on a topic a prep site lists for Wincent's online test. The wording is ours.

  1. What is the probability that the population eventually dies out?
    Answer and worked solution

    Answer: 0.5

    Key idea. Condition on the first minute: the line dies out only if every child's line dies out, independently.

    1. Let q = P(extinction from one cell).
    2. q = ¼·1 + ¼·q + ½·q² (die, stay one, split into two).
    3. Rearrange: 2q² − 3q + 1 = 0, so (2q − 1)(q − 1) = 0: q = ½ or 1.
    4. The mean number of offspring is 0·¼ + 1·¼ + 2·½ = 1.25 > 1, so extinction isn't certain: q = ½.

    Check. The answer is always the smallest root in [0, 1].

    Trap. Picking q = 1 because it solves the equation. It always does; it's the answer only when the mean is ≤ 1.

Interviewers may push further: What is the expected population after 3 minutes? (1.25³)

Source: QuantVault: Wincent online assessment (lists branching-process extinction) · Try it in the app →

Quant trading intern · Online test · Probability · reported by a candidate

500 ants are dropped at uniformly random points on a 1-metre stick, each facing left or right at random, walking at 1 cm/s. When two ants meet, both turn around. Ants fall off at the ends.

Candidates mention "500 ants falling off a 1 m stick" and "the ant collision problem from the Green Book" in Wincent's online test. The exact wording isn't public.

  1. What is the expected time, in seconds, until the last ant falls off?
    Answer and worked solution

    Answer: 99.8

    Key idea. Bouncing ants are indistinguishable from ants that pass through each other, which just swaps their labels.

    1. So each "ghost" ant walks straight off the end it faces.
    2. Its time is its distance to that end ÷ 1 cm/s: uniform on 0–100 s.
    3. The last ant falls at the maximum of 500 independent uniforms on [0, 100].
    4. E[max of n uniforms on [0, 1]] = n/(n + 1): 100 × 500/501 ≈ 99.8 s.

    Check. With many ants one is almost certainly near an end facing inward, so the answer is close to 100 s.

    Trap. Trying to track collisions. They don't change when ants fall off.

Interviewers may push further: What is the expected number of collisions? Which ant falls off last, and does it depend on the directions?

Source: Glassdoor: Wincent interviews, page 2 (quant trading intern, online test, 2026) · Try it in the app →

Quant (interview topic) · Interview · Bayes · practice question on a reported topic

20% of traders are skilled. A skilled trader makes money on a given day with probability 70%, an unskilled one with probability 50%. A trader made money on each of their first 3 days.

Our question on a theme candidates report from Wincent interviews (Bayesian updating).

  1. What is the probability that they are skilled?
    Answer and worked solution

    Answer: 0.40688

    Key idea. Bayes in odds form: posterior odds = prior odds × likelihood ratio.

    1. Prior odds skilled : unskilled = 0.2 : 0.8 = 1 : 4.
    2. Likelihood ratio for 3 winning days: (0.7/0.5)³ = 1.4³ = 2.744.
    3. Posterior odds = 2.744 : 4.
    4. P(skilled) = 2.744/6.744 = 343/843 ≈ 0.407.

    Check. Three good days roughly double the prior. Short track records say little about skill.

Interviewers may push further: How many winning days in a row before you are 90% sure they are skilled?

Source: Glassdoor: Wincent interviews (Bayesian statistics reported as a theme) · Try it in the app →

Quant trading (on-site betting games) · On-site · Bet sizing · practice question on a reported topic

You may bet any fraction of your bankroll, again and again, at even money on a coin that lands heads 60% of the time.

Wincent's on-site round is built around betting games. This is our warm-up for that format, not a reported game.

  1. (a) What fraction of your bankroll should you bet each time to maximise long-run growth?
    Answer and worked solution

    Answer: 0.2

    Key idea. Kelly maximises the expected log of your bankroll. For a bet paying b to 1 with win probability p: f* = p − q/b.

    1. Even money: b = 1.
    2. f* = 0.6 − 0.4 = 0.2 (20% of your bankroll).

    Check. Equivalently: f* = edge/odds = 0.2/1.

  2. (b) What is the expected log-growth per bet at that fraction?
    Answer and worked solution

    Answer: 0.020136

    Key idea. Each bet multiplies your bankroll by 1 + f or 1 − f.

    1. Expected log-growth = 0.6 ln(1.2) + 0.4 ln(0.8).
    2. = 0.6 × 0.1823 − 0.4 × 0.2231 = 0.1094 − 0.0893.
    3. ≈ 0.0201 per bet, about 2%.

    Check. Bet 40% (twice Kelly) and growth becomes slightly negative (−0.0024): a favourable bet that still shrinks your bankroll.

Interviewers may push further: The stakes double every round but the coin is the same. Does your fraction change? You are only 80% sure the coin is 60/40 (otherwise it is fair). What fraction now?

Source: Wincent: Internship experience (betting games where stakes build up) · Try it in the app →

Other firms

Jane Street · SIG (Susquehanna) · Optiver · IMC · Citadel / Citadel Securities · Five Rings · Two Sigma · Flow Traders · Maven Securities · Akuna Capital · Da Vinci Derivatives · DRW · Common formats · Hudson River Trading · Jump Trading · Eclipse Trading · Old Mission · Belvedere Trading · Squarepoint Capital · Valkyrie Trading · Virtu Financial · Tibra · Tower Research Capital · D. E. Shaw · Mako

Practise by subject instead: topic guides.