dsa2 min read
Convert Sorted List to BST — In-Order O(n) Build
Build a balanced BST from a sorted list in O(n) by counting nodes, building in-order, and consuming list nodes.
Read →
All Posts
1276 articles
dsa2 min read
LRU Cache — Doubly Linked List + HashMap Implementation
Implement LRU Cache from scratch using a doubly linked list with sentinel nodes and a hash map for O(1) operations.
Read →
dsa2 min read
Design Browser History — Doubly Linked List Implementation
Design a browser history with visit, back, and forward operations using a doubly linked list for O(1) navigation.
Read →
dsa5 min read
Linked Lists Master Recap — All Patterns & Templates
Complete cheatsheet for Linked Lists: all 7 patterns, template code, Big O reference, and MAANG interview priority guide.
Read →
dsa4 min read
Segment Trees & BIT (Fenwick Tree) — Complete Guide
Master Segment Trees and Binary Indexed Trees: range sum/min/max queries, point updates, lazy propagation, and 5-language implementations.
Read →
Page 84 of 256