Hard data structure and algorithm practice puzzle.
Given the sizes of free memory holes, in address order, and a list of requests, place each request in the FIRST hole big enough to hold it, and shrink that hole by the request. Return the hole index each request went into, or -1 if none fits. A request can fail even when there's more than enough free memory in total, just not in one piece.
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