ML Engineer MasterClass (April) | 6 seats left

The Secretary Problem

The Secretary Problem

Problem Statement

The Question

Interview question: You're hiring for a single position. There are $n$ candidates, and they arrive for interviews in a uniformly random order. After each interview, you can either hire that candidate immediately or reject them and move on. Rejections are permanent: you cannot go back. You can observe each candidate's relative rank among everyone you've seen so far, but you have no...

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