Skip to content

Latest commit

 

History

History
12 lines (8 loc) · 249 Bytes

dynamic_programming.md

File metadata and controls

12 lines (8 loc) · 249 Bytes

Dynamic Programming

Its a technique to break big problem into smaller chunks and optimize them.

Characteristics

  1. Overlapping subproblem
  2. Optimal substructure property

Methods

  1. Top-down with memoization
  2. Bottom-up with Tabulation