Dynamic Programming compilation

 DYNAMIC PROGRAMMING COMPILATION

Basic Recurrence Relation (Fibonacci type)

1. Domino and Tromino tiling 
   
2. 552. Student Attendance Record II 
   
3. Dice Combinations (CSES) 
   
4. 1269. Number of Ways to Stay in the Same Place After Some Steps 
   
5. 
   

a[i+1] constrained on a[i] (=> f[n][d], a[i] taking values 0 to d-1)

1. 1220. Count Vowels Permutation 
   
2. 935. Knight Dialer 
   
3. Vacation (Atcoder) 
   
4. Array Description (CSES)
   
5. 
   

   Matrix chain multiplication type (try all possibilities -> memoisation)

1. Rectangle cutting (CSES)
   
2. 312. Burst Balloons 
   
3. 
   

Dp on strings -> LCS Type

Choice of selection from an array (Knapsack type)