Leetcode 1338. Reduce Array Size to The Half

Find the minimum number of distinct values to remove (deleting all their occurrences) so that at least half the array's elements are gone — equivalently, count element frequencies and greedily pick the largest frequencies until their sum is ≥ n/2.

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 1338. Reduce Array Size to The Half

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact