Intermediate · Coding interviews: lists, trees and graphs
Linked lists
Seven interview problems on linked lists: reversing one, finding where a cycle starts, removing a node from the end, adding numbers held as digits, reordering a list from both ends, copying a list with random links and a least recently used cache.
- You build
- reverse.py, then cycle.py, then remove.py, then add.py, then reorder.py, then copy_list.py, then lru.py
- Stages
- 7 Problems
- Time
- About 2.5 hours
Loading the workspace…
Loading the workspace…