← Questions
Top K frequent elements and K closest points
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Two warm-up style problems that the interviewer combined into one round:
- Return the
kpoints closest to the origin. - Return the
kmost frequent values in a list.
Then combine them: rank items by frequency and break ties (or filter) by distance. Discuss heap versus quickselect and their complexity.
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