Given a list of integers S and a target number k, write a function that returns a subset of S that adds up to k. If such a subset cannot be made, then return null. Integers can appear more than once in the list. You may assume all numbers in the list are positive. For example, given S = [12, 1, 61, 5, 9, 2] and k = 24, return [12, 9, 2, 1] since…

gistfile1.txt

#!/usr/bin/env ruby

def isSubsetSum(set,n, sum) 
    return true if (sum == 0) 
    return false if (n == 0 and sum != 0) 
    return isSubsetSum(set, n - 1, sum) if (set[n - 1] > sum) 
    return isSubsetSum(set, n-1, sum) || isSubsetSum(set, n-1, sum - set[n-1])
end 

s = [12, 1, 61, 5, 9, 2] 
k = 24
puts isSubsetSum(s, s.size(), k)