Prim's Algorithm: Growing a Minimum Spanning Tree
Learn Prim's algorithm for finding minimum spanning trees starting from a vertex, using a greedy approach with priority queues.
// Posts (Page 35)
Recursion and Backtracking: Patterns and Pitfalls
Master recursive thinking, base cases, call stack management, and backtracking algorithms for generating permutations and combinations.
Red-Black Trees: Balanced Search Trees with Simpler Rotations
Master red-black tree properties, insertion fixup cases, and color flip mechanics. Learn when RB trees outperform AVL and when they don't.
Segment Trees: Range Queries and Updates
Build segment trees for O(log n) range sum, min, max queries with lazy propagation for efficient range updates in competitive programming.
Skip Lists: Layered Linked Lists for Fast Search
Understand skip lists as probabilistic alternatives to balanced trees, providing O(log n) search with simple implementation and lock-free variants.
Sliding Window: Dynamic Subarray Problems
Solve maximum subarray, longest substring, and subarray average problems with O(n) time using the sliding window technique.
Sorting Algorithm Comparison: When to Use Which
Compare all major sorting algorithms by time complexity, space usage, stability, and practical use cases.
Stacks, Queues, and Deques: Sequential Access Structures
Master LIFO, FIFO, and double-ended queue operations with implementations, time complexity analysis, and practical applications.
Tarjan's Strongly Connected Components
Find strongly connected components in directed graphs using DFS-based Tarjan's algorithm with lowlink values.
Topological Sort: Ordering Directed Acyclic Graphs
Learn topological sorting using DFS and Kahn's algorithm for dependency resolution in directed acyclic graphs.