Available question text
Given an even-length integer array, repeatedly pair the smallest and largest elements, compute their averages, and return the smallest such average — equivalently, sort the array and take the minimum of (nums[i] + nums[n-1-i]) / 2 across all i.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3194. Minimum Average of Smallest and Largest Elements
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source