Medium data structure and algorithm practice puzzle.
Given a list of charges and a list of payments, return every charge that doesn't have a payment of the same amount, smallest first. Duplicates matter: three charges of 50 need three payments of 50. Each payment can only cover one charge.
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 Trip Retention Curve, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles