Greedy Algorithms: Making Locally Optimal Choices
Learn when greedy algorithms work, how to prove correctness using exchange arguments, and common greedy patterns.
Posts tagged with #algorithms
Individual Sorting Algorithms: Bubble, Selection, Insertion, Merge, Quick, Heap
Deep dive into each major sorting algorithm with implementations, complexity analysis, and when to use each.
Knapsack Problem Variants
Master the 0/1, unbounded, and fractional knapsack variants with DP solutions and optimization techniques for resource allocation problems.
Kruskal's Algorithm: Building Minimum Spanning Trees
Learn Kruskal's algorithm for finding minimum spanning trees in weighted graphs using union-find data structures.
Linear Search vs Binary Search: When Each Algorithm Wins
Compare linear and binary search algorithms, understand when to use each variant, and master binary search for production systems.
Longest Increasing Subsequence: Patience Sorting
Find the longest strictly increasing subsequence in O(n log n) time using patience sorting and binary search techniques.
Memoization vs Tabulation: Two Faces of Dynamic Programming
Understand the two fundamental DP approaches—top-down with memoization and bottom-up with tabulation—plus hybrid techniques like the/m on the fly.
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.
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.