• 2

What will I practice?

Greedy algorithmsScheduling

This puzzles uses sorting techniques, and greedy algorithms. You have to rely on performant algorithm to pass all test cases.


The goal of this puzzle is to schedule the planning of different group of users for a super computer, so that as many experiments as possible can be run on it. Keep in mind that efficient solutions are sometime not so complex once the problem has been turned in the right way.

A higher resolution is required to access the IDE


Your university research department recently acquired a brand new, shiny super computer. Problem is, everyone wants to use it. Some dude at the chemistry lab wants to run a one week experiment, your colleague Martin needs it for a "real quick try, I promise", etc... It's not going to be easy to have everyone satisfied with the planning.

Your task will be to schedule the different experiments running on the computer so that as many experiments as possible can be run.

Online Participants