0-1 Knapsack

Subset Sum

Equal Sum Partition Problem

Count of subsets with sum equal to X

Minimum sum partition

Count the number of subset with a given difference

Count all subsequences having product less than K

Target Sum

Flip Array

Ones and Zeroes (3D DP)