Leetcode 2860. Happy Students
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.