← Goldman Sachs questions

Minimum size subset for a given sum

Filed under Goldman Sachs

Given an array of positive integers and a target sum, find the minimum number of elements from the array whose sum equals the target. If it's not possible, return -1.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Goldman Sachs questions

Collected from public candidate posts and coding forums. Updated Nov 2026.