In this video, I want to introduce you to another strategy that can be used to solve a set of DP questions.
This strategy is called the partition strategy.
Now the partition strategy is a combination of the gap strategy or lengthwise iteration and backtracking.
Now we have discussed both of these techniques in previous videos.
Now in this section let's see how we can combine these two techniques to solve a set of dynamic programming
questions.