Available question text
Count how many group sizes k (0 ≤ k ≤ n) make every student happy — equivalently, count k such that exactly k elements of nums are strictly less than k and no element equals k.
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 2860. Happy Students
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source