Dynamic Programming & Combinatorics
Optimal substructure, and generating or counting combinatorial objects.
Topics
Problems attacked from this category
- Coin change1
- Combinatorial game solving2
- Context-free parsing2
- Counting combinatorial structures8
- Counting up to symmetry2
- DP transition optimization7
- Dynamic programming on trees2
- Edit distance and sequence alignment2
- Hamiltonian paths and tours1
- Hidden Markov model inference2
- Interval scheduling1
- Knapsack3
- Linear recurrence evaluation1
- Longest increasing subsequence2
- Markov decision process solving2
- Matrix chain parenthesization2
- Maximum subarray3
- Necklaces and de Bruijn sequences3
- Optimal weighted search trees1
- Parameter estimation1
- Partition enumeration4
- Permutation generation5
- Ranking and unranking3
- Shuffling and permutation1
- Spanning tree counting and sampling4
- String segmentation2
- Subset and combination enumeration6
- Subset and poset transforms4
- Subset sum and partition2
- Symbolic summation and integration1
- Tiling and matching counts6
- Traveling salesman2