Hard data structure and algorithm practice puzzle.
Given a ray's origin and direction and a box's min and max corners, return true if the ray hits the box. On each axis, work out when the ray enters and leaves the space between that axis's two walls. Keep the latest entry and the earliest exit across all three. If it exits before it enters, or the exit is behind the ray, it missed.
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 Retention Curve, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles