Round 1
Questions:
-
Given an array A of integers and an integer K, the task is to distribute the value K across the elements of A such that the maximum value in the array is minimized across all possible distribution cases. Return the minimized maximum value after the distribution.
-
Given an array of integers, the task is to find the largest element in the array such that when this element is removed, the sum of the remaining elements is also present in the array. If multiple such elements exist, return the largest one.
- Example:
A = {1, 2, 3, 4, 10, 16} Output = 16
- Example:
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.