# Category:Subset Dynamic Programming

Jump to navigation Jump to search
 This is a stub or unfinished. Contribute by editing me.

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.

## Pages in category "Subset Dynamic Programming"

This category contains only the following page.