Choose the invariant or failure response implied by each operation contract. Check the working program against a direct reference model.
Lessons
- Linear hashing: split one bucket at a time as a table grows
- Compressed 2D Fenwick trees: toggle known points and count rectangles
- Persistent two-list queues: fork FIFO dispatch history
- Balanced-parentheses trees: encode an ordered hierarchy