Compute expected coin flips to meet on octagon
OptiverData Scientist · Technical Screen
Last updated
Compute expected coin flips to meet on octagon evaluates statistical assumptions, formulas, estimation strategy, uncertainty, edge cases, and interpretation in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Two independent particles start at opposite vertices (four edges apart) of a regular octagon. At each time step, flip one fair coin for each particle: heads moves one step clockwise, tails one step counterclockwise. What is the expected total number of coin flips required until the two particles occupy the same vertex?
Solution walkthrough is for members
Get the full walkthrough with reference code and complexity analysis, plus Kitty Coach at 300 messages a day. Hints, the code runner and community answers stay free.