Found 12 articles
Introduces graph representations, tree properties, and Kahn's algorithm for topological sorting.
Explains union-find with analogies, path compression, and common applications like connected components and Kruskal.
Explains 1D/2D prefix sums and difference arrays for fast queries and range updates.
Walks through bitwise operators, bitmask tricks, lowbit, and GCC built-ins for efficient set handling.
Covers GCD/LCM, primality testing, and modular arithmetic with fast exponentiation.
Covers custom sorting, binary search (including search-on-answer), two pointers, and discretization tricks.
Shows when pure simulation or brute force is the right tool, including pruning and bitmask enumeration.
Teaches how to judge time and space complexity, apply the 10^8 rule, and pick algorithms by input size.
Walks through the most practical STL containers and algorithms that form the core toolkit for contests.