I’m trying to solve a problem where we need to find the minimum number of operations required to make two integer arrays nums and target (same length) equal. In one operation, we can select a subarray in nums and increment/decrement each element by 1.

“I recently found a frustrating error in my code. I have two solutions for finding the minimum path sum using dynamic programming (DP). The first solution, which I wrote, doesn’t seem to work, even though the logic seems perfect. Here’s my code:

I have recently learned Dynamic Programming Language.
There is an assignment that I’m working on which I’m stuck on it.
I should find the total sum of score which is maximized after this tour and each landmark should visit at most once except except the beginning and the end
here is what I have wrote