Easy data structure and algorithm practice puzzle.
Given each child's minimum cookie size and the sizes of the cookies, return the most children you can make happy, one cookie each. Sort both lists. Walk the cookies from smallest to largest, and give each one to the least demanding child it can satisfy. Never waste a big cookie on a small appetite.
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 Ticket Coverage Report, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles