Medium data structure and algorithm practice puzzle.
Given a tree of resource groups where each node sets a limit, and a path down from the root (0 means left, 1 means right), return the limit that actually applies at the end of the path. A child can never get more than its parent allows, so it's the SMALLEST limit anywhere on the path. If the path leads to a missing node, return -1.
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.
Browse all 546 puzzles