Google | L4 | Phone Screen

Round 1

Questions: There is a fixed size array of integers. And we are given a number S. We need to pick a number x from integers (doesn't have to be in the array) and truncate each array integer to largest optimal number such that sum of array after truncations is storage limit S.