3759. Count Elements With at Least K Greater Values

LeetCodeArrayBinary SearchDivide and ConquerSortingQuickselectOpen on judge ↗

You are given an integer array nums of length n and an integer k. An element in nums is said to be qualified if there exist at least k elements in the array that are strictly greater than it. Return an integer denoting the total number of qualified elements in nums. Example 1: Input: nums = [3,1,2], k = 1 Output: 2 Explanation: The elements 1 and 2 each have at least k = 1 element greater

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