← Optiver Interview Insights

Optiver·Software Engineer·Technical Phone Screen·Intermediate

IntermediatePrefer not to say
May 2026

Summary

Interviewed for a quant engineering role at Optiver and got hit with a classic probability/random walk problem. Short interview, one meaty question, and a lot of mental scrambling on my end.

Questions Asked (1)

Q1

Consider a 2D random walk where a particle moves up, down, left, or right each with equal probability. What is the probability that the particle eventually returns to the origin?

Algorithms & Data StructuresTechnical Trade-offs
Author's notes

This is a known result in probability theory but I blanked on the proof structure mid-explanation.

Create a free account to read the full note

AI HintsAI Generated

Suggested Approach

Recognize that the 2D simple random walk is recurrent, meaning the particle returns to the origin with probability 1. Explain the intuition and provide a rigorous argument, such as using the divergence of the sum of return probabilities or the connection to electrical networks.

Pro tip: Mention that in 3D the walk is transient (Polya's theorem), showing you understand the broader context and can generalize.

1. Clarify the problem

Confirm that the walk is symmetric and independent at each step, and that 'eventually returns' means at some finite time >0.

2. State the answer

The probability is 1. The 2D simple random walk is recurrent.

3. Provide intuition

Explain that in 2D, the number of possible paths grows but the probability of return at step 2n decays like 1/n, so the sum of return probabilities diverges.

4. Give a rigorous argument

Use the fact that the expected number of returns is infinite, which for a Markov chain implies return probability 1. Alternatively, use electrical network theory: 2D grid has infinite resistance.

5. Mention extensions

Note that in 1D it's also recurrent, but in 3D and higher it's transient (Polya's theorem).

Key Points to Mention

  • Recurrence of 2D simple random walk
  • Polya's theorem (recurrent in 1D and 2D, transient in 3D+)
  • Probability of return at step 2n ~ 1/(π n)
  • Divergence of sum of return probabilities
  • Connection to electrical networks (infinite resistance)
  • Expected number of returns is infinite

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