top of page
Search
Design an LRU Cache
Caching is critical in systems design, from web browsers to database engines. An LRU (Least Recently Used) cache evicts the least recently used entry when full, ensuring hot data stays accessible. Implementing one in code tests your mastery of linked lists, hash maps, and constant-time operations.
2 days ago5 min read
Contains Duplicate Within K Distance
Checking for nearby repeated events in a log or sensor stream is a common task in monitoring, fraud detection, and real‑time analytics....
5 days ago4 min read
Longest Consecutive Sequence
Finding the longest run of consecutive days, IDs, or timestamps in a dataset comes up in analytics, event processing, and scheduling systems. This “Longest Consecutive Sequence” problem is a great way to exercise hashing, set membership, and thinking about how to avoid redundant work.
5 days ago4 min read
Subarray Sum Equals K
Finding how many contiguous stretches of transactions sum to a target turns up in budgeting tools, analytics dashboards, and real‑time...
May 64 min read
Group Anagrams
Clustering words that are anagrams of each other is a classic interview problem and mirrors real‑world tasks like building search indexes...
May 64 min read
bottom of page