Dynamic-Programming

LC, CODEWITHMIK, TUF

Dp probem with true/ false scenarios

*IMP 122. Best Time to Buy and Sell Stock II

https://leetcode.com/problems/minimum-cost-to-cut-a-stick/solutions/780880/dp-with-picture-burst-balloons/

1547. Minimum Cost to Cut a Stick
1548. Burst Balloons
1549. Minimum Cost to Merge Stones
1550. Minimum Score Triangulation of Polygon

there are certain prblms which may seem like dp: but dp would be an overkill.

-> 3100. Water Bottles II

here we may have multiple options but until and unless i have empty bottled i dony have much of a choice..

when u use dp... pay attention on how many variable are changing .... 
 IF 2 varialble are chaning use 2D dp array 
 IF 3 ... use 3D