Review: Dynamic Programming Problems

Dynamic programming problems scare me A LOT.

Yeah, it could be quite frustrating, if you haven’t found the key assertions.



Dynamic Programming is an algorithmic paradigm that solves a given complex problem by breaking it into subproblems and stores the results of subproblems to avoid computing the same results again.

The main idea behind DP is to save duplicated caculations.

Trade space for time.


Key Parts In DP Problems:

  1. Key observation is crucial. Watch careful for how the states transit?
  2. Walk through with smaller cases manually. And detect the pattern.

Different Types Of DP Functions:


The most impressive problems to me:


See all dynamicprogramming problems: #dynamicprogramming

See more blog_posts.

linkedin
github
slack

Share It, If You Like It.

Leave a Reply

Your email address will not be published.