Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Storage Systems Interview Preparation
·
Module 3
Data Structures Under Interview Constraints
1
Hash Table Operations with Collision Handling
Implement lookup, insertion, and deletion in a hash table with collision handling.
2
Stack and Queue Traversal Within Time and Space Bounds
Use a stack or queue to solve a traversal problem within a stated time and space bound.
3
Solving Search and Aggregation Problems with Binary-Tree Traversal
Apply binary-tree traversal to solve a search or aggregation problem.
4
Heap-Based Solutions for Top-K and Streaming Selection
Use a heap to solve a top-k or streaming-selection problem.
5
Implementing an LRU Cache with a Hash Table and Doubly Linked List
Implement the core operations of an LRU cache using a hash table and doubly linked list.
Previous module
C Interview Skills for Systems Engineers
Next module
Concurrency and Low-Level Synchronization