The Secretary Problem

Level 9●●●●○ Hard~8 min

Problem

You interview nn candidates one at a time in random order. After each, you must immediately hire or reject (no recall), and you only learn relative ranks. You want to maximise the probability of hiring the single best candidate. What is the optimal strategy and the probability it succeeds for large nn?