Concepts5
⚙️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
⚙️AlgorithmAdvanced
Broken Profile DP
Broken Profile DP is a dynamic programming technique that sweeps a grid one cell or one column at a time while encoding the boundary between processed and unprocessed cells as a compact state.
#broken profile dp#profile dp#plug dp+11
⚙️AlgorithmIntermediate
Digit DP
Digit DP is a dynamic programming technique for counting or aggregating values over all integers in a range that satisfy a digit-based property.
#digit dp#dynamic programming#tight constraint+12
⚙️AlgorithmIntermediate
Bitmask DP - Subset Enumeration
Bitmask DP subset enumeration lets you iterate all submasks of a given mask using the idiom for (s = mask; s > 0; s = (s - 1) & mask).
#bitmask#submask enumeration#superset enumeration+11
⚙️AlgorithmIntermediate
Complete Search and Backtracking
Complete search enumerates every candidate solution, while backtracking prunes branches that cannot possibly lead to a valid or better solution.
#complete search#backtracking#recursion+12