Flips Till Two in a Row

This combinatorics question is about understanding how a random process evolves when you are allowed to make limited, state-dependent interventions. You observe a configuration, choose an action consistent with the rules, and then see how that action probabilistically changes the configuration. The key challenge is recognizing that the evolution can be encoded in a finite set of states with probabilistic transitions.

It trains comfort with Markov chains, conditional probability, expectations over random stopping times, and writing down clean state-based recurrences. It also builds the habit of translating an informal, game-like description into a rigorous mathematical model suitable for quant prep and systematic analysis.

This matters for quant interviews because trading, risk, and execution problems often reduce to Markovian dynamics under constraints. Interviewers use this style of question to test modeling skills, probabilistic intuition, and clarity of thought under pressure.

What it tests

This problem class is governed by the principle of Markovian state transitions and the Law of Total Expectation. When a process evolves in discrete steps, and each step's outcome depends only on the current state (not the history), you can model the expected value of a quantity (like total flips) by conditioning on the present state and recursively relating it to future states. The key is to identify all possible states, determine the transition probabilities between them, and set up equations for the expected value from each state. This structure is powerful because it reduces a seemingly complex, multi-stage process to a system of linear equations. The Law of Total Expectation then allows you to combine these conditional expectations, weighted by their probabilities, to find the overall expected value.