4 docs tagged with "competitive-programming"

Master advanced backtracking techniques including word search, palindrome partitioning, constraint propagation, and branch-and-bound optimization.

Master advanced dynamic programming techniques including interval DP, bitmask DP, digit DP, and DP optimizations with Knuth-Yao and divide-and-conquer.

Master advanced greedy techniques including greedy with sorting, priority queue applications, task scheduling, and when greedy fails.

Master the most important greedy algorithm problems: fractional knapsack, Huffman coding, job scheduling, and interval scheduling maximization