The Core DP Logic: The K-1 Step Jump

Now you will not be able to try at every index here. K is two. That is why we can

try at every index because, like, we can try it here, then we can try

it here, right? But suppose I'm just making some arbitrary numbers.

Suppose the array value is seven and the key value is three. So you can perform,

like, you can start splitting at this and this entire thing. Then you cannot

split it here because you will not be able to, you know, merge one and five.

This was a single cost and we would return one value from this entire right sub-part and

we would add this to our entire this value which, l- which are consecutive. But if we reduce