Medium data structure and algorithm practice puzzle.
Given a list of labels, return the Gini impurity, rounded to 3 decimals. Count each label, turn the counts into probabilities, and return 1 minus the sum of their squares. It's the chance that two items picked at random have DIFFERENT labels. A group with one label scores 0. Decision trees use it because it skips the logarithm that entropy needs.
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 Sample Retention Curve, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles