why am i failing one test case
https://ide.codingblocks.com/s/45399
Subset sum to target by dp
Hey Jai, complexity of your code is exponential as it is checking for all the subsets in worst case, So try to solve this question using 2D DP that will be of complexity O(n*sum).