Subset Sums | Recursion / Backtracking

geeksforgeeks.org Given an array arr[] of size N, generate the sum of every possible subset. Return all subset sums. Every element has only two choices: Include it Exclude it For N elements: 2 × 2 × 2 × ... N times which gives: 2^N subsets We recursively explore both choices for every element and ca