// TOPIC
#stacks
3 articles
◆Beginner
01Stacks and Queues: Order Matters
Learn LIFO vs FIFO, how the call stack works, and when a stack or queue is exactly the right tool — the two simplest constrained collections in CS.
#stacks#queues#data-structures
8 min◆BeginnerAmazonGoogle
02Deques (Double-Ended Queues)
A deque gives you O(1) push and pop from both ends — and the sliding-window-maximum trick that turns O(n²) brute-force problems into clean O(n) solutions.
#deques#queues#stacks
12 min◆BeginnerAmazonGoogle
03Stacks
The stack data structure explained from first principles — LIFO semantics, O(1) push and pop, and why it shows up everywhere from your call stack to balanced-parentheses checkers.
#stacks#data-structures#fundamentals
10 min