3 Heads in 6 Coin Tosses

This classic quant prep question is about counting patterns in short random sequences. You work with a simple model of repeated independent trials and must focus on how a particular pattern can appear inside that finite sequence while respecting the underlying probabilistic structure. It sits at the intersection of basic combinatorics and discrete probability, and is a staple of early-stage quant interviews because it looks elementary yet hides subtle structural constraints.

It trains your ability to isolate a specific run inside a longer sequence while controlling for interactions with neighboring outcomes. You must track overlaps, avoid unintended repetitions, and keep the total count consistent. More broadly, it reinforces clean sample-space thinking, event definition, and disciplined enumeration, all of which are fundamental tools in quant interviews and technical quant prep.

This matters for quant interviews because run-based reasoning is ubiquitous in market models, risk sequences, and path-dependent products. Interviewers use this type of combinatorics question to check whether you can manage simple but interdependent constraints without getting lost in casework. Even at easy difficulty, it reveals whether you can turn a verbal description of a stochastic scenario into a precise combinatorial framework, a core expectation for junior quant roles.

What it tests

Problems involving runs of consecutive outcomes in sequences (like coin tosses) are governed by the principle of combinatorial pattern isolation: to count sequences with exactly one occurrence of a specific run, you must both ensure the run appears and actively prevent it from being extended or duplicated. This requires careful placement of 'blocking' elements (like tails) before and after the run, and ensuring that the rest of the sequence does not inadvertently create another run. The pattern holds because in any sequence, the presence of a run is not independent of its surroundings—adjacent elements can merge runs or create new ones, so you must account for all possible overlaps and exclusions. The key is to enumerate all valid placements of the run and systematically subtract or exclude cases where the run is extended or repeated, which is why direct counting or inclusion-exclusion is often used.