Data-Structures-and-Algorithms/Subset Sum Problem at master · shoaibrayeen/Data-Structures-and-Algorithms · GitHub

Name		Name	Last commit message	Last commit date
parent directory ..
code_1.cpp		code_1.cpp
code_2.cpp		code_2.cpp
code_3.cpp		code_3.cpp
code_4.cpp		code_4.cpp
readMe.md		readMe.md

readMe.md

Given a set of non-negative integers, and a value sum, determine if there is a subset of the given set with sum equal to given sum.

Example:

Input: set[] = {3, 34, 4, 12, 5, 2} , sum = 9

Code 1 : using recursion

Code 2 : using DP - Polynomial Space

Code 3 : using DP - Space Optimization [ Linear Space ]