Expected Tosses Conditional on HHT Appearing Before HTH

Quick Overview

Compute the conditional waiting time for HHT to beat HTH using suffix states, success probabilities, conditioned transitions, and exact expectation equations.

Expected Tosses Conditional on HHT Appearing Before HTH

Company: DRW

Role: Quantitative Researcher

Category: Statistics & Math

Difficulty: medium

Interview Round: Online Assessment

A fair coin is tossed until either HTH or HHT appears in three consecutive tosses. Given that HHT appears first, find the expected number of tosses, including the final toss. ### Clarifying Questions to Ask - Do overlapping occurrences count, using the latest three consecutive tosses? - Is the expectation conditioned on HHT winning rather than on either pattern ending the process? ```hint Keep only useful suffixes Track suffixes that are prefixes of one of the two target patterns, then condition transitions on eventual HHT success. ``` ### What a Strong Answer Covers - States for the empty suffix, H, HT, and HH. - Eventual HHT-winning probabilities before conditioning. - Conditional transition probabilities and expected-time equations. ### Follow-up Questions - Why does a run of additional heads leave the HH state unchanged? - Why is the unconditional waiting-time expectation not the requested answer?

Overview: Compute the conditional waiting time for HHT to beat HTH using suffix states, success probabilities, conditioned transitions, and exact expectation equations.

Read the full DRW Quantitative Researcher interview experience this question came from

DRW logo
DRW
Nov 21, 2026
mediumQuantitative ResearcherOnline AssessmentStatistics & Math
0
0

A fair coin is tossed until either HTH or HHT appears in three consecutive tosses. Given that HHT appears first, find the expected number of tosses, including the final toss.

Clarifying Questions to Ask Guidance

  • Do overlapping occurrences count, using the latest three consecutive tosses?
  • Is the expectation conditioned on HHT winning rather than on either pattern ending the process?

What a Strong Answer Covers Guidance

  • States for the empty suffix, H, HT, and HH.
  • Eventual HHT-winning probabilities before conditioning.
  • Conditional transition probabilities and expected-time equations.

Follow-up Questions Guidance

  • Why does a run of additional heads leave the HH state unchanged?
  • Why is the unconditional waiting-time expectation not the requested answer?