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
Level order traversal
Given the root of a binary tree, return its values grouped by depth: a list of lists, the first holding the root, the next holding the root's children left to right, and so on. An empty tree gives [].
inroot = [3, 9, 20, None, None, 15, 7]out[[3], [9, 20], [15, 7]]
inroot = [1]out[[1]]
inroot = []out[]
You can read it now. The editor opens when the check is cleared.