ML Engineer MasterClass (April) | 6 seats left

The Coupon Collector Problem

The Coupon Collector Problem

Problem Statement

The Question

Interview question: There are $n$ distinct coupon types. Each cereal box you buy contains exactly one coupon, chosen uniformly at random from all $n$ types. You keep buying boxes until you have at least one coupon of every type. How many boxes do you expect to buy?

Unlock the full lesson

Created by interviewers from Google and Meta. Master every concept you need to land your dream role.

All courses — Data, ML/AI & Quant
Unlimited coding submissions
Hands-on projects with real datasets
Detailed solutions in text & video
Monthly content updates
Join Premium