In this article, we will solve Subset Sum problem using a backtracking approach which will take O(2^N) time complexity but is significantly faster than the recursive approach which take exponential time as well.

This is a companion discussion topic for the original entry at http://iq.opengenus.org/subset-sum-problem-backtracking/