Leetcode 3194. Minimum Average of Smallest and Largest Elements

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3194. Minimum Average of Smallest and Largest Elements

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact