Medium data structure and algorithm practice puzzle.
Given how long each job takes, return the total time all jobs spend waiting if you always run the shortest job first. Sort the jobs by length. Each job waits for every job ahead of it, so keep a running clock and add it to the total before each job runs. Shortest first gives the lowest total wait, but long jobs can wait forever.
Solve it three ways: snap the jigsaw pieces together, fill in the blanks, or type it from scratch against the tests. This one is free.
Every line of the solution comes with a note explaining why it is there, and a step by step replay shows the code running. At level 3, where you type it yourself, you can ask for an AI mock interview on this problem that ends with a hiring manager's scorecard.
Browse all 546 puzzles