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.
Fully Commented Code. VTU Lab programs for DAA lab as per CBCS2017 Scheme
Algorithms based on dynamic programming
SubsetSum: a study on 'The Subset-Sum Problem'.
A script witten by ChatGPT to help you find all unique combinations of numbers that add up to a specific target sum
Add a description, image, and links to the subset-sum-solver topic page so that developers can more easily learn about it.
To associate your repository with the subset-sum-solver topic, visit your repo's landing page and select "manage topics."