dsa2 min read
Design Min Stack — O(1) Minimum with Auxiliary Stack
Implement a stack that supports push, pop, top, and retrieving the minimum element in O(1) time using an auxiliary min-stack that tracks minimums at each level.
Read →
All Posts
1276 articles
dsa2 min read
Find Median from Data Stream — Two-Heap Approach
Maintain a running median from a data stream using two heaps: a max-heap for the lower half and a min-heap for the upper half, rebalancing after each insertion.
Read →
dsa2 min read
Design Circular Queue — Ring Buffer Implementation
Implement a circular queue (ring buffer) with fixed capacity supporting enQueue, deQueue, Front, Rear, isEmpty, and isFull in O(1) time using head and tail pointers.
Read →
dsa2 min read
Design URL Shortener (TinyURL) — Hashing and Encoding
Design a URL shortener like TinyURL that encodes long URLs to short codes and decodes them back. Uses base-62 encoding with a counter or random string generation.
Read →
dsa1 min read
Design Parking System — Counter-Based Slot Management
Design a parking system with big, medium, and small spaces. O(1) addCar checks if space is available and decrements the counter, returning whether the car was parked.
Read →
Page 246 of 256