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 competition.
Repository from Github https://github.comparthnan/SubsetSum-BacktrackAlgorithm
