Solving Algorithms One Whiteboard at a Time
The key to this is realizing that to get to test if you can get to a target index from the current index, you can add the current index to its value. For instance, if index 3 has the value of 5, you add 3 and 5, which gives you 8. If your target index …
The key to understanding this problem is this. You need an array that will keep track of the possible sums you can get by adding the numbers in the nums array in various ways. For example, if the nums array is [1, 2, 3], the combination sum array will be [true, true, true, true, true, …