← Goldman Sachs questions
CodingEasy

Maximum elements subset sum less than k

Filed under Goldman Sachs

Given an array of n integers and a number k, select the maximum number of elements from the array whose sum is strictly less than k, and output their sum.

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.