Subset Sum Combinations Finder

Subset Sum Combinations Finder: a task in Terminal-Lego-15k (Harbor dataset). Implement a program that finds all possible combinations of numbers from a given set that add up to a specified target sum. Each number in the set can only be used once per combination, but the same number may appear…

The task

Implement a program that finds **all possible combinations** of numbers from a given set that add up to a specified target sum. Each number in the set can only be used once per combination, but the same number may appear multiple times in the input set (and each occurrence is treated as a distinct element).

Part of PrimeIntellect/Terminal-Lego-15k.