This repository contains several examples of dynamic programming, implemented using different techniques such as tabulation, memoization, and recursion. The purpose of these examples is to provide a clear understanding of how these methods work and when to use each one.
- Tabulation Method: This method involves solving problems iteratively and storing the results in a table (array) to avoid recomputation.
- Memoization Method: This method is a top-down approach where the results of subproblems are stored in a cache (typically a dictionary) to avoid redundant calculations.
- Recursion Method: This approach solves problems by breaking them down into smaller subproblems, solving each recursively.
Each file in this repository is a standalone example of a specific dynamic programming problem, solved using one of the methods mentioned above. You can run these scripts individually to see how each method approaches the problem.
- Clone this repository,Navigate to the directory and Run:
git clone https://github.com/yourusername/dynamic-programming-examples.git cd Problem_Solving python filename.py
If you have any questions or suggestions, please feel free to open an issue or contact me via bhuvani1102@gmail.com.