Concepts4
⚙️AlgorithmIntermediate
Complexity Analysis Quick Reference
Use an operation budget of about 10^8 simple operations per second on typical online judges; always multiply by the time limit and number of test files if known.
#time complexity#competitive programming#big-o+12
⚙️AlgorithmIntermediate
Bitset Optimization
Bitset optimization exploits word-level parallelism so one CPU instruction processes 64 bits at once on typical 64-bit machines.
#bitset#word-level parallelism#bitmask+12
⚙️AlgorithmIntermediate
Meet in the Middle
Meet-in-the-middle splits a hard exponential search into two halves, enumerates each half, and then combines results efficiently.
#meet in the middle#subset sum#pair sums+12
⚙️AlgorithmIntermediate
Knapsack Problems
Knapsack problems ask how to pick items under a weight (or cost) limit to maximize value or to check if a target sum is reachable.
#0/1 knapsack#unbounded knapsack#bounded knapsack+12