Gamified challenge · Queue
One ticket counter, opening at time 0. Person i is people[i] = [arrival, service, vip]: when they turn up, how long they take at the counter, and 1 for a VIP. Whenever the counter is free it serves, among those who have arrived, VIPs first, then the earliest arrival, then the lowest index; with nobody waiting it idles until the next arrival.
Write serveOrder(people) (serve_order in Python) that returns the indexes in the order they're served. For [[0, 3, 0], [1, 2, 0], [2, 2, 1], [4, 1, 0]] that's [0, 2, 1, 3]: the VIP who arrives at time 2 is next when the counter frees up at time 3.
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google