Dynamic Programming

This page contains question about the dynamic programming

  1. 70: Climb Stairs
  2. 746: Min Cost Climbing Stairs
  3. 303: Range Sum Query - Immutable
  4. 307: Range Sum Query - Mutable @todo
  5. 53: Maximum Subarray
  6. 121: Best Time to Buy and Sell Stock
  7. 122: Best Time to Buy and Sell Stock II
  8. 714: Best Time to Buy and Sell Stock with Transaction Fee
  9. 309: Best Time to Buy and Sell Stock with Cooldown
  10. 198: House Robber
  11. 213: House Robber II
  12. 337: House Robber III (DFS)
  13. 322: Coin Change
  14. 377: Combination Sum IV
  15. 518: Coin CHange II
  16. 416: Partition Eqaual Subset Sum
  17. 62: Unique Path
  18. 63: Unique Path II
  19. 64: Minimum Path Sum
  20. 120: Triangle
  21. 139: Word Break
  22. 813: Largest Sum of Averages
Dynamic Programming - Ruizhen Mai