aditiap/dynamicprogcontri

Dynamic Programming

This repository contains all standard question on dynamic programming. Question are picked from different programming platforms like codechef, codeforces, geeksforgeeks, leetcode etc.

What is dyamic programming?

Dynamic Programming is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for 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. For example, if we write simple recursive solution for Fibonacci Numbers, we get exponential time complexity and if we optimize it by storing solutions of subproblems, time complexity reduces to linear.

For more information about dynamic programming visit: https://www.geeksforgeeks.org/dynamic-programming/

Any submissions or question from topic dynamic programming are welcome.