1
00:00:00,110 --> 00:00:08,210
In this video, I want to introduce you to another strategy that can be used to solve a set of DP questions.

2
00:00:08,240 --> 00:00:11,540
This strategy is called the partition strategy.

3
00:00:11,570 --> 00:00:20,540
Now the partition strategy is a combination of the gap strategy or lengthwise iteration and backtracking.

4
00:00:20,570 --> 00:00:24,650
Now we have discussed both of these techniques in previous videos.

5
00:00:24,680 --> 00:00:32,000
Now in this section let's see how we can combine these two techniques to solve a set of dynamic programming

6
00:00:32,000 --> 00:00:32,750
questions.