Hard data structure and algorithm practice puzzle.
Given item weights, item values, and a capacity, return the most value you can carry when you can take part of an item, rounded to 2 decimals. Sort the items by value per unit of weight, best first. Take as much of each as fits, and take a fraction of the last one. With fractions allowed, this greedy approach is always the best.
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.
Then grow it into a real project with the Software Engineer button: this puzzle becomes the Order Calendar Merger, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles