# Category:Subset Dynamic Programming

This is a type of dynamic programming done on ${\displaystyle k}$ objects where your array of DP values has ${\displaystyle 2^{k}}$ entries, one for each subset of the objects.