Hi once again, @system7514817679, and my apologies for the late response.

And sorry for being so repetitive here, referring to the topic you made earlier (Two pointer solution to rainwater capture needs some explaining), remember that sometimes to understand better code that has been provided to you, one must have to āreverse engineerā it.

And just like @realkennylin said, in his post on that topic:

So if you would like to see how the final matrix looks like. Copy the code from the solution to any text editor and just use `console.log()`

to visualize any variable you are curious about. If the output is too complex, try maybe using other inputs. Such as the first example that is being provided to you in the article you shared:

```
weightCap = 5
weights = [1, 3, 5]
values = [250, 300, 500]
```

Changing the inputs a couple of times and checking how the code works can reinforce that you have understood the codeās methodology.

Your other two questions are actually answered in the quote from the article that you provided. We just have to analyze it a bit further.

#### Why are we using weightcap + 1 number of columns?

(ā¦) The columns represent how much weight the knapsack can hold. If we are at column `7`

, then we are looking at a subset of the larger problem where our knapsack has a weight capacity of `7`

. (ā¦)

(ā¦) Likewise, every element in the zeroeth column represents a subproblem where our knapsack has a capacity of 0, giving us no value to take. Because of this, we start by filling the zeroeth row and column with `0`

. (ā¦)

So if every column represents the weight that the knapsack can carry, starting from 0, then we will need a `weightCap + 1`

length array to fill all the spots. In other words, we want to know which items fill in the whole knapsack, but to do so we need to check how many items (alone or in a bundle) have a weight of 0, then 1, then 2, 3, 4, ā¦ and so on until we reach the knapsack full capacity. And since we start from 0, until we get to `weightCap `

, we will have to make a total of `weightCap + 1`

tests.

(Also there is a ā`numItems + 1`

ā number of rows, as we start from 0 to the total of items. But, for some reason, the article doesnāt mention this. To corroborate this information check the `matrix`

generated)

#### Why is the optimal solution in the bottom right?

(ā¦) The rows represent the items we have seen. (ā¦) The columns represent how much weight the knapsack can hold. (ā¦) By the time we get to the bottom right space in `matrix`

, we have considered every possible subproblem and taken the maximum possible value."

So the only way to know the optimal solution for the problem is to consider all of the items (only able at the last row), and that the knapsack is full (last column).

Donāt forget that if you are still having problems please reply to this post, I will be always glad to help you in any way I can.

Happy coding !