Secretary problem: N candidates arrive in random order. You must decide immediately whether to hire each one. Optimal strategy: skip the first k* ≈ N/e candidates to learn the distribution, then hire the next one better than all previous. This achieves success probability → 1/e ≈ 36.8% as N→∞, independent of N.