Available question text
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.
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 1608. Special Array With X Elements Greater Than or Equal X
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source