Medium data structure and algorithm practice puzzle.
Given a page table tree where a nonzero value is a real mapping and 0 is empty, return how many levels down the deepest mapping is. Empty branches don't count, so a tree with no mappings is 0. A node counts if it's mapped or has a mapping somewhere below it. Each level is another trip to memory, which is why page tables are kept shallow.
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