Algorithms
Study Material for Algorithms
Ch 10: Sorting & Frequency Arrays
std::sort — The Workhorse · lower_bound & upper_bound — Binary Search in STL · binary_search — Boolean Existence Check · unique — Removing Consecutive Duplicates · next_permutation — Generating Permutations · Sorting Applications · Frequency Counting
Ch 15: Binary Search (Array & Answer Space)
Binary Search on a Sorted Array · STL Binary Search Functions · Binary Search on the Answer · Boundary Handling
Ch 14: Two Pointers & Sliding Window
Two Pointers (Opposite Direction) · Two Pointers (Same Direction) · Sliding Window (Fixed Size) · Sliding Window (Variable Size)
Ch 13: Prefix Sums & Difference Arrays
1D Prefix Sums · 2D Prefix Sums · Suffix Sums & Suffix Aggregates · Difference Arrays
Ch 16: Greedy Algorithms & Constructive Problems
The Greedy Paradigm · Sorting-Based Greedy · Interval Scheduling (Activity Selection) · The Exchange Argument · Constructive Algorithms
Related Topics
Published by RunTimeFix · Comprehensive guides for competitive programming