Locked
Pass the Dictionary check first
Everything after it builds on dictionaries. Each rep in the check has to be passed without opening the solution. Hints and Basics are fine.
Still to clear · 8 of 8
- Trace: keep the table
- Which line crashes?
- Write: menu from two lists
- Write: total a bill
- Debug: cheapest item
- Write: items under a budget
- Write: who sits where
- Write: apply price changes
Preview · where this ladder is heading
Maximum Depth of Binary Tree
Given the root of a binary tree, return how many nodes lie on the longest path from the root down to any leaf. An empty tree has depth 0.
in[3, 9, 20, None, None, 15, 7]out3
in[1, None, 2]out2
in[]out0
You can read it now. The editor opens when the check is cleared.