Algorithm · Jane Street · Hard
This question has two independent parts. Part 1: Checkout line choice You are standing in a checkout line with n customers. Positions are numbered from 1 at the front to n at the back, and your current position is k. Each checkout serves exactly one customer per unit of time. At time 0, a second checkout counter opens. The new checkout is identical to the original one, and both begin serving at time 0. Each of the other n - 1 customers independently decides to move to the…
Checking your access…