Great tutorial, thanks! I'm noob in dp. Is there any similar problem which does not need this optimization and just focused in this way of solving you mentioned in the "Dynamic Programming Solution" part?
Hey, it’s been a while since I recorded this. Are you referring to how we’re fixing the number of subarrays as the first dimension instead of the second one?
@@AlgorithmsConquered Thanks for response. I mean before implementing optimization using d&c , I need to learn this structure of dp. some similar question which needs this dp structure.
Sorry, I don’t remember any problems that follow this pattern from the top of my head. I’ve done quite a few so I know there are many. You can try finding problems that ask you to partition an array into some subarrays with some objective.
awesome job! keep it up
Thanks!
Great tutorial, thanks! I'm noob in dp. Is there any similar problem which does not need this optimization and just focused in this way of solving you mentioned in the "Dynamic Programming Solution" part?
Hey, it’s been a while since I recorded this. Are you referring to how we’re fixing the number of subarrays as the first dimension instead of the second one?
@@AlgorithmsConquered Thanks for response. I mean before implementing optimization using d&c , I need to learn this structure of dp. some similar question which needs this dp structure.
Sorry, I don’t remember any problems that follow this pattern from the top of my head. I’ve done quite a few so I know there are many. You can try finding problems that ask you to partition an array into some subarrays with some objective.
Is there any reson you have set optr to n-1 in start and then increasing by 1?
I use optr + 1 because I want the loop condition to be j
really cool tutorial
Thank you!
Awesome!