when we are trying to solve a problem with dynamic programming. we have to follow some general steps
- characterize the solution structure
- Recursively define optimal solution
- compute the value from bottom up fashion
Can anyone briefly explain the steps for this problem scenario. we need a 444 meter rope. but we have only small pieces of ropes. then we have to find out the minimum number of pieces of rope needs to construct that large rope.