Insights about dynamic programming

Dynamic Programming is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of subproblems so that we do not have to re-compute them when needed later. This simple optimization reduces time complexities from exponential to polynomial.

In this session, you will get to know everything related to Dynamic Programming.

Support the community here: commudle.com/communities/cdn-data-structures-and-algorithms