🏛️ Subset Temple

📚 Subset Sum Problem

Find all subsets that sum to target K using backtracking:

• For each element, decide: Include or Exclude
• If sum equals K, we found a valid subset!
• If sum exceeds K, prune (stop exploring this path)
• Backtrack and try other combinations
• Time: O(2^n) in worst case