← Questions
Remove the fewest distinct values to delete half the array
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Pick a set of distinct values and delete every occurrence of each from an integer array. Return the smallest set size that removes at least half of the elements. Explain the greedy by frequency and whether you can avoid a full sort.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding