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
Merge Two Sorted Lists
You get the heads of two linked lists, each already in non-decreasing order. Combine them into one sorted list by relinking the existing nodes, and return the head of the combined list.
inl1 = 1 -> 3 -> 5, l2 = 2 -> 4out1 -> 2 -> 3 -> 4 -> 5
inl1 = empty, l2 = 0out0
inl1 = empty, l2 = emptyoutempty (None)
You can read it now. The editor opens when the check is cleared.