Quick Summary
- Design a capacity-limited key-value store that dynamically filters data based on a sliding time window.
- Support insertion, retrieval, deletion, and average calculations while enforcing expiration and eviction rules.
- Requires balancing fast lookups with efficient maintenance of temporal order and aggregate metrics.
What This Tests
- Hash table operations for constant-time key lookup
- Doubly linked list manipulation for tracking recency
- Time-window filtering and expiration handling
- Running aggregate maintenance under dynamic updates
- Complex data structure composition and edge case management
Common Patterns
Hashing
Linked List
Ask AI Assistant
Ask AI Assistant
Ask me anything about this coding question!
Test Cases
Input
Output
Expected