← Morgan Stanley Interview Insights

Morgan Stanley·Software Engineer·Technical Phone Screen·Intermediate

IntermediatePrefer not to say
Mar 2026

Summary

Morgan Stanley quant engineer interview, one round that was basically a pure math puzzle. Not what I expected walking in, but looking back it makes sense for the role.

Questions Asked (1)

Q1

A dog runs around a circle of radius 1 at speed 4. You start somewhere inside the circle and can move at speed 1. The dog always moves in whichever direction gets it to your projected exit point fastest. Can you escape the circle, and if so, how?

Algorithms & Data StructuresTechnical Trade-offs
Author's notes

This wrecked me for the first few minutes.

Create a free account to read the full note

AI HintsAI Generated

Suggested Approach

First, clarify the problem setup and define escape as reaching the circle's boundary without being caught. Then, analyze the dog's strategy and derive a winning strategy for the runner by exploiting the dog's need to commit to a direction, using angular positioning and a dash to the boundary.

Pro tip: Emphasize that the solution hinges on the runner staying diametrically opposite the dog until the last moment, then sprinting to the nearest boundary point. This demonstrates an understanding of pursuit-evasion games and the importance of timing.

1. Clarify the problem

Restate the problem in your own words, confirming assumptions: the dog runs along the circumference at speed 4, you start inside at speed 1, and the dog moves to intercept your projected exit point. Define escape as reaching the boundary without being caught.

2. Analyze the dog's strategy

Explain that the dog always moves to minimize the time to reach your projected exit point. This means it will run along the shorter arc to that point. Note that the dog's direction may change if your projected exit point changes.

3. Develop a runner strategy

Propose that you first move to the center, then position yourself diametrically opposite the dog. Maintain this opposition by moving slowly in a circle of radius r < 1/4. Once the dog is committed to one direction, sprint radially outward to the boundary.

4. Prove escape is possible

Show that by staying opposite, you force the dog to be at least π radians away from your exit point. Calculate the time for you to reach the boundary from radius r: (1 - r)/1, and the dog's time to reach the exit point: (π * 1)/4. Choose r such that (1 - r) < π/4, e.g., r = 1/4 gives 0.75 < 0.785, ensuring you escape.

5. Discuss edge cases and trade-offs

Consider if the dog can anticipate your move. If the dog can change direction instantly, the strategy still works if you wait until the dog is moving away. Mention that the solution is tight: if the dog were faster or the runner slower, escape might be impossible.

Key Points to Mention

  • The dog's optimal strategy is to minimize the arc length to the projected exit point.
  • The runner can maintain a diametrically opposite position by moving in a small circle of radius less than 1/4.
  • The critical condition for escape: (1 - r) < π/4, which holds for r = 1/4.
  • The dog's commitment to a direction creates a window of opportunity for the runner to sprint to the boundary.
  • The solution is a classic pursuit-evasion problem, often solved using angular separation and timing.
  • Trade-offs: increasing r reduces escape time but risks the dog being closer; the optimal r balances these.

AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.