Search
⌘K

Leetcode 1608. Special Array With X Elements Greater Than or Equal X

Determine whether there exists an integer x (0 ≤ x ≤ n) such that exactly x elements in nums are ≥ x; return that unique x if it exists, otherwise return -1.


Question Timeline

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

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