Medium data structure and algorithm practice puzzle.
Given an array, a target, and k, return the k values closest to the target, sorted from smallest to largest. Sort the values by their distance from the target. If two are equally close, keep the one that comes first in the array. Take the first k, then sort those by value.
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 Read Matcher, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles