Minimum Average of Smallest and Largest Elements
You have an array of floating point numbers averages which is initially empty. You are given an array nums of n integers where n is even.
You repeat the following procedure n / 2 times:
- Remove the smallest element,
minElement, and the largest element,maxElement, fromnums. - Add
(minElement + maxElement) / 2toaverages.
Return the minimum element in averages.
Example 1
Input
nums = [7,8,3,4,15,13,4,1]Output
5.5The smallest element of averages, 5.5, is returned.
Example 2
Input
nums = [1,9,8,3,10,5]Output
5.5After repeatedly pairing the smallest and largest elements, averages is [5.5, 6, 6.5], so the minimum is 5.5.
Constraints
- 2 <= n == nums.length <= 50
- n is even.
- 1 <= nums[i] <= 50
Asked at 2 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.