2 docs tagged with "knapsack"

Master fundamental dynamic programming problems including 0/1 Knapsack, Longest Common Subsequence, Longest Increasing Subsequence, Coin Change, and Edit Distance.

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