← Goldman Sachs questions
CodingReported in a candidate post, Aug 2020

Minimize array sum after K operations

Filed under Goldman Sachs

Given an array of positive integers, you can perform at most K operations. In each operation, replace an element a[i] with ceil(a[i]/2). Find the minimum possible sum of the array after these…

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.