Algorithm · Netflix · Hard
Three tasks make up this round, and they should be attempted in order: simulating a cache with time-based expiry, driving a text buffer that supports undo, and walking an organization tree depth-first. Along the way you are expected to design clean interfaces, behave correctly on degenerate inputs, and be ready to justify the running time and memory cost of each solution. Part 1: Cache with Expiration Times Build an in-memory cache in which every inserted entry carries an…
Checking your access…