Data Structures & Algorithms
Deep dives into core DSA concepts, patterns, and curated practice problems. Each article is written to build intuition, not just memorize solutions.
Binary Search — Concept
Binary search is not just searching in a sorted array. It's about finding a boundary in a monotonic decision space. Covers templates, invariants, and floating-point binary search.
Binary Search — Practice Questions
Curated list of 40+ binary search problems from LeetCode, GeeksforGeeks, Codeforces, and SPOJ — organized by pattern.
Heaps & Heapsort — One-shot notes
Priority Queue ADT, Binary Heap (max & min), Max_Heapify, Build_Max_Heap, HeapSort — complete walkthrough with demos, pseudocode, and complexity proofs.
Time & Space Complexity Analysis
Comprehensive guide to asymptotic analysis, Big-O, recurrences, Master Theorem, Akra–Bazzi, and amortized analysis — with mathematical methods and practice problems.