The subset sum puzzle

The subset sum puzzle is a classic problem in computer science and mathematics. It involves determining if any non-empty subset of a given set of integers sums to a specific target value.