Gamified challenge · Greedy choice
It's night, and a group must cross a rickety bridge that holds at most two people. They have one torch, and nobody crosses without it. times[i] is how many minutes person i takes; when two cross together they walk at the slower one's pace. Everyone starts on the left with the torch, and trips alternate: forward (1 or 2 people to the right), then back (1 or 2 people returning the torch), and so on.
Write crossings(times) that returns the trips in order, each the person indexes separated by a space, getting everyone across in the minimum total time. For [1, 2, 5, 10] one best answer is ["0 1", "0", "2 3", "1", "0 1"]: 2 + 1 + 10 + 2 + 2 = 17 minutes.
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