ONE MODULE AT A TIME
Lists, maps and algorithm contracts
Use explicit contracts and tested examples to explain encounter order, complexity and memory.
Data structures & algorithms
Lists, maps and the first repeated ID
Validate a precise contract, find the first repeated encounter and explain expected linear time with extra memory.
Data structures & algorithmsBinary search: boundaries, duplicates and total cost
Find the leftmost match with a shrinking interval, test edge cases and distinguish search-phase cost from full validation cost.