Summary

Bottom-up DP

  • This approach stores the results of subproblems in a table
  • Iterative implementation
  • Entries are filled bottom-up from the smallest size to the final size
  1. Visualize the problem as a table
  2. Size the table based on inputs
  3. Initialize table with default values
  4. Seed trivial answers in table
  5. Iterate through table, and fill further positions based on current position

Problems: