Medium data structure and algorithm practice puzzle.
Given two lists, return their Jaccard similarity, rounded to 3 decimals: how many values they share, divided by how many different values there are in total. Turn both into sets first, so duplicates and order don't matter. If both are empty, return 0. Search engines compare documents this way to spot near-duplicates.
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 Step Fuzzy Matcher, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles