Given an array of n integers and a target sum k, find the size of the smallest subset of numbers whose elements sum up to k. Return -1 if no such subset exists.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.