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.

Company

Level

Region

Comments

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

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2860. Happy Students

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact