We have discussed the “subset sum problem using dynamic programming” . We can solveĀ  subset sum problem using backtracking algorithm. For example if there is set S{ 1,3,9,2} and given sum is 5, find whether any subset of set S whose elements ads up to sum 5.

subset sum problem using backtracking

subset sum problem using backtracking