How D.E. Shaw Interviews in 2026: Process, Questions & What They Score

1. 01

   You roll a fair die repeatedly until you've seen all six faces: what is the expected number of rolls? (classic coupon-collector setup, answer ~14.7 via 6 x sum(1/k); reported as a D. E. Shaw staple across multiple sources)

   Coupon-collector expectation; sum 6/k over remaining faces gives about 14.7 rolls.

2. 02

   Break a stick at two independent uniformly random points: what is the probability the three resulting pieces can form a triangle? (answer 1/4; confirmed as a recurring D. E. Shaw quant-analyst question)

   Geometric probability classic; the triangle inequality on three pieces yields 1/4.

3. 03

   A symmetric random walk starts at 0 on the integers: what is the expected number of steps to first reach +1? (candidates are expected to recognize this expectation is infinite despite the walk reaching +1 with probability 1; confirmed D. E. Shaw question)

   Random-walk subtlety: reaching +1 is certain but the expected hitting time is infinite; recognize the trap.

4. 04

   Given a disease with a known base rate and a test with known sensitivity/specificity, what is the probability someone who tests positive actually has the disease? (Bayes'-theorem / base-rate framing)

   Bayes' rule with base rates; low prevalence makes the posterior far smaller than test accuracy suggests.

5. 05

   You have N coins, one of which is biased: design an experiment/estimator to identify the biased coin and reason about how many trials you'd need (confirmed D. E. Shaw question)

   Tests statistical experiment design: hypothesis testing and how trial count scales with the bias size.

6. 06

   Compute or reason about portfolio variance given correlated asset returns (e.g., two stocks with a given correlation: find the variance of an equally-weighted portfolio)

   Tests variance algebra: combine asset variances with the covariance term for a weighted portfolio.

7. 07

   n lily pads arranged on a circle; a frog jumps to an adjacent pad with equal probability each step: what is the expected time to visit every pad? (confirmed D. E. Shaw question, sometimes phrased with the frog starting at time 0 on a unit circle)

   Cover-time problem on a cycle; use symmetry and known random-walk hitting-time results.

8. 08

   Given a Gaussian (normal) random variable under certain conditions, compute a specified conditional expectation

   Tests normal-distribution mechanics: computing conditional expectations under given constraints.

Reported problems, listed so you know what to expect. Practice them in your own editor or on the platform you prefer; SupaCV's practice mode coaches how you talk through them.

1. 01

   Walk me through your thesis/research project in depth: what was the hypothesis, methodology, and what would you do differently?

   Research deep dive testing methodological rigor: hypothesis, design choices, and honest hindsight.

2. 02

   How did you validate your model or results out-of-sample, and how did you guard against overfitting?

   Tests validation discipline: out-of-sample testing and concrete overfitting safeguards.

3. 03

   What was the most interesting negative or null result you encountered in your research, and how did you handle it?

   Probes research honesty: how you interpret and act on null or negative results.

4. 04

   What are the limitations of the approach you used, and how might it connect to adjacent fields or methods?

   Tests critical distance from your own work: known limitations and links to adjacent methods.

5. 05

   What's an underrated or overlooked problem in your field right now?

   Tests depth of field awareness: naming a specific open problem and arguing why it is underrated.

Reported problems, listed so you know what to expect. Practice them in your own editor or on the platform you prefer; SupaCV's practice mode coaches how you talk through them.

1. 01

   Solve a maximum-subarray-style problem optimally (Kadane's algorithm) and explain the complexity trade-offs (confirmed D. E. Shaw question)

   Tests Kadane's algorithm for maximum subarray and the O(n) versus brute-force complexity argument.

2. 02

   Detect a loop in a linked list / find the intersection point of two linked lists (confirmed D. E. Shaw question)

   Tests pointer techniques: Floyd's cycle detection and length-alignment for list intersection.

3. 03

   Search in a rotated sorted array (confirmed D. E. Shaw question)

   Tests modified binary search: identify the sorted half each iteration to keep O(log n).

4. 04

   Implement a thread-safe queue for single- and multiple-producer/consumer scenarios (confirmed D. E. Shaw question)

   Concurrency exercise: mutex and condition-variable design across producer-consumer configurations.

5. 05

   Solve a dynamic-programming problem such as the classic 'egg drop' puzzle (confirmed D. E. Shaw question)

   Dynamic programming puzzle; the insight is minimizing worst-case trials, not expected trials.

6. 06

   Level-order (breadth-first) traversal of a binary tree, and related tree/BST problems (confirmed D. E. Shaw question)

   Tests BFS with a queue on binary trees plus general tree and BST manipulation.

7. 07

   Design/discuss a system (for more senior engineering candidates), plus questions on operating systems (paging, virtual memory, deadlocks), databases (ACID properties, SQL, normalization, indexing), and networking fundamentals (OSI/TCP-IP, subnetting), all confirmed recurring D. E. Shaw OA/interview topics

   Breadth check: system design plus OS paging and deadlocks, ACID and indexing, and TCP/IP fundamentals.

8. 08

   Explain and handle floating-point precision issues in a numerical computation problem

   Tests numerical-computing care: representation error, catastrophic cancellation, and safe comparison strategies.

Reported problems, listed so you know what to expect. Practice them in your own editor or on the platform you prefer; SupaCV's practice mode coaches how you talk through them.

1. 01

   Company X is trying to decide whether to renovate its office space or move to a new location: what factors would you consider to help make a recommendation? (a case-study example from D. E. Shaw's official interviewing guide, in its exact wording)

2. 02

   What businesses or industries do you think will be impacted by shifts in energy production to renewable sources? (a case-study example from D. E. Shaw's official interviewing guide, in its exact wording)

1. 01

   What have you read or worked on recently outside of your formal coursework/job that you found intellectually exciting?

1. 01

   What would you do if you were working on a project and weren't sure about your next steps? (an example from D. E. Shaw's official interviewing guide, in its exact wording)

2. 02

   How would you approach building relationships if you were new to a project or team? (an example from D. E. Shaw's official interviewing guide, in its exact wording)

3. 03

   Imagine you need to make a decision that isn't clear-cut: how would you weigh the pros and cons? (an example from D. E. Shaw's official interviewing guide, in its exact wording)

1. 01

   Why D. E. Shaw specifically, and how does it differ from other firms you're considering (e.g., Two Sigma, Citadel, Jane Street)?

2. 02

   Tell me about a time you disagreed with a colleague or manager about a technical approach: how was it resolved?

3. 03

   Describe a project or result that didn't work out: how did you communicate that and what did you learn?

4. 04

   How has your approach to solving a specific problem evolved with more experience or new information? (an example from D. E. Shaw's official interviewing guide, in its exact wording)

5. 05

   When have you collaborated with a team to achieve goals, and what were your individual contributions? (an example from D. E. Shaw's official interviewing guide, in its exact wording)

6. 06

   What books, papers, or intellectual pursuits outside of work have you engaged with recently?

7. 07

   Tell me about a time you had to explain a complex technical idea to a non-expert audience.