Dynamic-Programming-Problems
This repository contains Solutions of Famous DP problems.
Basic Problems
- Maximize The Cut Segments --> (Solution)
- Target Sum --> (Solution)
- Coin Change Problem --> (Solution).
- Minimum Number of Coins --> (Solution)
- Longest Common Subsequence --> (Solution)
- Longest Common Substring --> (Solution)
- Shortest Common Supersequece --> (Solution)
- String Subsequence --> (Solution)
- Max Array Sum --> (Solution)
Challenging Problems
- Watching CPL --> (Solution)