Subset sum problem Packages

Given a set of integers find all subsets that add up to a given target integer. negatives, positves, zeroes, and duplicates allowed.

The Fastest and Smallest Subset finder. Finds all subsets from an array that equal a target number. In O(N log N) time and 2N+2 Space.

The Fastest and Smallest Subset finder. Finds all subsets from an array that equal a target number. In O(N log N) time and 2N+2 Space.