3678. Smallest Absent Positive Greater Than Average

LeetCodeArrayHash TableOpen on judge ↗

You are given an integer array nums. Return the smallest absent positive integer in nums such that it is strictly greater than the average of all elements in nums. The average of an array is defined as the sum of all its elements divided by the number of elements. Example 1: Input: nums = [3,5] Output: 6 Explanation: - The average of nums is (3 + 5) / 2 = 8 / 2 = 4. - The smallest absent

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