Mitsogo OA | 4th feb 2024 | Allen's Value
Question · Posted Apr 2026
Question 1: Allen's Value Problem Description: You are given an array A of N (≥3) distinct integers. Your friend Allen removes exactly 2 elements from this array, adds a constant value X (X>0) to all the remaining elements, shuffles the array, and leaves the newly formed array G for you. Your task is to return the minimum possible value X that Allen could have added to each remaining element of array A to produce array G. It is guaranteed that ...
The full answer & interview discussion are available to premium members.
Log in Create a free account