Medium data structure and algorithm practice puzzle.
Given a triangle's three corners a, b, and c and a point p, return p's barycentric weights [w0, w1, w2], rounded to 4 decimals. Each weight is how close p is to one corner, worked out from the areas of the small triangles p makes with the other two corners. They always add up to 1, and if any is negative, p is outside the triangle.
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 Frame Streak Finder, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles