3194. Minimum Average of Smallest and Largest Elements

LeetCodeArrayTwo PointersSortingOpen on judge ↗

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, from nums. - Add (minElement + maxElement) / 2 to averages. Return the minimum element in averages. Example 1: Input: nums = [7

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI