Rényi's parking problem: cars of unit length arrive at random positions on [0, L].
If a car fits (no overlap), it parks; otherwise it leaves. The jamming limit coverage
is 1 − e^{−2} ≈ 74.76% — no further cars can fit despite significant gaps remaining.
In 2D with disks, the jamming fraction is approximately 54.7%.