Subset Sum Problem using Dynamic Programming【O(N*sum) time complexity】

In this article, we will solve Subset Sum problem using a dynamic programming approach which will take O(N * sum) time complexity which is significantly faster than the other approaches which take exponential time.

This is a companion discussion topic for the original entry at

The cpp code doesn’t work. anything you input into is always = no required subset found.