Solving the popular NP problem, The Subset Sum Problem, with an Amortized O(n) algorithm based on Recursive Backtracking. The Algorithm stood second fastest in the organized Intra-University ...

Sum Of Subset Problem Sum of Subset problem is to find Subset of elements from a given Set whose Sum adds up to a given number K. Set Contains non-negative values.