This repository contains Python solutions to various dynamic programming challenges.
- Coin Problem (number of solutions): Solution to the "Coin Problem" counting the number of solutions.
- Coin problem.py: Solution to the "Coin Problem" finding the minimum number of coins needed.
- Counting tilings.py: Solution to the "Counting Tilings" problem.
- Edit distance.py: Solution to the "Edit Distance" problem.
- Knapsack problem.py: Solution to the "Knapsack Problem".
- Longest increasing subsequence.py: Solution to the "Longest Increasing Subsequence" problem.
- Paths in a grid.py: Solution to the "Paths in a Grid" problem.
Each Python file contains the solution to a specific dynamic programming problem. You can view the code and use it as needed.
Feel free to contribute by adding more solutions or improving existing ones!