D. E. Shaw Interview Questions and Answers
Last updated 2026-11-19
D. E. Shaw is a quantitative investment and technology firm, and its interviews are commonly described as problem-solving heavy: probability, puzzles, algorithms and clean reasoning spoken aloud. Memorised answers matter less than showing how you break a problem down.
The questions below are practice problems in that style, with fully worked answers. They are not real papers. For harder DSA practice see D. E. Shaw coding round questions, and for the probability foundations see probability and aptitude questions.
| Rounds (commonly reported) | Online screen, then DSA, probability and puzzle interviews |
|---|---|
| Applications (India) | Through deshawindia.com, per the firm's fellowships page |
Rounds as commonly reported
Reports describe an online screening with aptitude or coding questions, followed by several interviews. The interviews mix data structures and algorithms, probability and puzzles, and fundamentals such as operating systems or networks, then a conversation with a senior person about your background and motivation. The firm does not publish its process, so treat this as an approximate pattern and follow the instructions your recruiter gives.
How to answer puzzles
Restate the problem, state assumptions, solve a smaller version, then generalise. If you recall the answer, say so and still show the reasoning; interviewers care about the method and will often change the constraints to see how you adapt.
Hiring status
There is no D. E. Shaw page under /hiring on this site. The sourced fact we have: the D. E. Shaw fellowships page says applications for India internships and jobs are made through deshawindia.com, and it names no India fellowship open at the time we checked; a FinSpire Fellowship 2026 (Hyderabad, for women in the first year of a non-engineering undergraduate programme) was listed. For current roles, use the D. E. Shaw India careers site.
D. E. Shaw Interview Questions and Answers: questions with worked answers
1 What is the expected number of coin flips to get two heads in a row?
mediumLet E be the expected flips from the start, and H the expected flips after one head. From the start: E = 1 + 0.5 H + 0.5 E. After one head: H = 1 + 0.5 times 0 + 0.5 E. Substituting, E = 1 + 0.5(1 + 0.5E) + 0.5E = 1.5 + 0.75E, so E = 6.
2 You roll a fair die four times. What is the probability of at least one six?
easyUse the complement. The chance of no six is (5/6) to the power 4 = 625/1296, so the answer is 1 - 625/1296 = 671/1296, about 0.518. The same method answers many "at least one" questions.
3 Monty Hall: should you switch?
easyYes. Your first pick is right with probability 1/3, and the host, who knows where the car is, always opens a goat door. Switching wins exactly when the first pick was wrong, which has probability 2/3. A useful intuition is a hundred doors: after 98 goat doors are opened, the one remaining door holds the car with probability 99/100.
4 25 horses, 5 tracks, no timer: find the fastest 3 in the fewest races.
hardSeven races. Races 1 to 5: five groups of five. Race 6: the five group winners; label the order A1, B1, C1, D1, E1, so A1 is fastest overall. Only five horses can still be in the top three: A2, A3, B1, B2 and C1. Everything else is beaten by at least three horses. Race 7: those five; the first two finishers are second and third overall.
5 100 doors, 100 people toggling multiples. Which doors end open?
easyDoor n is toggled once for each divisor of n. It ends open only if it has an odd number of divisors, which happens exactly for perfect squares, because divisors pair up as d and n/d except when d equals n/d. So doors 1, 4, 9, ..., 100 are open: 10 doors.
6 Two eggs, a 100-floor building: minimum drops in the worst case to find the critical floor?
mediumDrop the first egg from floors 14, 27, 39, ... with decreasing gaps 14, 13, 12, ... so that the total worst case stays 14. If the first egg breaks at floor f, step the second egg upward linearly from the previous safe floor. The smallest n with n(n+1)/2 at least 100 is 14, so the worst case is 14 drops.
7 Four people, one torch, crossing a bridge in 1, 2, 5 and 10 minutes. Minimum total time?
medium17 minutes. Send 1 and 2 across (2), 1 returns (1), send 5 and 10 (10), 2 returns (2), send 1 and 2 (2): 2 + 1 + 10 + 2 + 2 = 17. The trick is pairing the two slowest together so their times overlap.
8 Expected number of rolls of a fair die to see every face at least once?
mediumThis is the coupon collector problem. After i faces are seen, the wait for a new face is geometric with mean 6/(6 - i). The sum is 6(1/6 + 1/5 + 1/4 + 1/3 + 1/2 + 1) = 6 times 2.45 = 14.7 rolls.
9 Select one item uniformly at random from a stream of unknown length.
mediumReservoir sampling with k = 1: keep the first item; for the i-th item (1-indexed), replace the chosen one with probability 1/i. By induction every item is chosen with probability 1/n: item j survives with probability (1/j)(j/(j+1))...((n-1)/n) = 1/n. Space O(1).
pythonimport random def pick_stream(stream): chosen = None for i, x in enumerate(stream, 1): if random.randrange(i) == 0: chosen = x return chosen10 What are the four conditions for deadlock and how do you prevent one?
mediumMutual exclusion, hold and wait, no preemption and circular wait must all hold. Break any one: acquire all locks at once (no hold and wait), allow preemption through timeouts, or impose a global lock ordering (no circular wait). In practice lock ordering is the standard fix.
11 Why are you interested in D. E. Shaw rather than a pure software company?
easySay something specific and honest: you enjoy problems where correct reasoning under uncertainty matters, you like that technology and quantitative research sit close together, and you want a team where ideas are judged on evidence. Be ready to discuss one probability or algorithm project you did and what you would do differently.
12 Tell me about a time you solved a problem you initially had no idea how to approach.
easyDescribe how you broke it down: reduced to a small case, searched for a similar known problem, tested a hypothesis with a quick experiment. Include a point where you were wrong and how you noticed. The interviewer is looking for method and intellectual honesty rather than a perfect result.
Frequently asked questions
Does D. E. Shaw ask puzzles?
Candidate reports commonly mention probability questions and puzzles alongside algorithms. Prepare both, but expect the method to matter more than the answer.
What coding level is needed?
Practise medium to hard data structures and algorithms. See the D. E. Shaw coding round questions.
Is there a fixed list of questions?
No. Interviewers adapt questions, so learn the underlying techniques instead of memorising puzzles.
Where do I apply?
Through the D. E. Shaw India careers site, deshawindia.com, which the firm's fellowships page names as the route for India roles.
Sources
Related guides
More in Company Interview Questions
- Delhivery Coding Round Questions
- Delhivery Interview Questions with Answers
- Dell Coding Round Questions with Solutions
- Dell Technologies Interview Questions and Answers for India Freshers
- Deloitte coding round questions
- Deloitte interview questions and answers
- Deutsche Bank coding round questions with solutions
- Deutsche Bank interview questions with answers (technology graduates)
- Directi Coding Round Questions With Solutions
- Directi Interview Questions and Answers
- Dream11 Coding Round Questions with Solutions
- Dream11 Interview Questions and Answers