Subset Sum, is a Backtracking related problem and in this post we will see how we can solve this challenge in C++

/Given an array and a 'k'.Find the subset of the array elements whose sum is equal to k TC:2^arr.size By sorting the data we can improve its performance

Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @susantabiswas