Longest Increasing Subsequence: Patience Sorting
Find the longest strictly increasing subsequence in O(n log n) time using patience sorting and binary search techniques.
Posts in technical
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.
Mock Technical Interviews: Practice Guide
How to simulate real interview conditions, get feedback, and improve systematically using self-assessment and peer practice.
Pointers and Memory Management: A Deep Dive
Master pointer arithmetic, memory layout, stack vs heap allocation, and common memory bugs in C/C++ and systems programming.
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.
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.