## unknown Interview Question for Software Engineer / Developers

Comment hidden because of low score. Click to expand.
0
of 0 vote

3d plane = 3d space... but this is not important... :)
is there a metric/distance like Euclidean metric?

It is not possible because you can't say when to finish - you have an infinite number of points. :)
A very simple alg: If infinite = a very large number, N, I'd use a max-heap of size k.
TC: O(N log k).

If you are looking for something more sophisticated, en.wikipedia.org/wiki/Nearest_neighbor_search

Comment hidden because of low score. Click to expand.
0
of 0 votes

we will use max-heap or min heap..I am confused bcuz as a new data come and we take minimum of that(heap) and next is larger then we can remove lowest in heap. and insert it in heap of k.And again find minium and so on

Comment hidden because of low score. Click to expand.
0
of 0 votes

We can sort all points(N) using Quicksort where pivot is found randomly. When the random pivot is bigger than the K, then finds a new pivot on the left; or on the right. The time coplexity is nlg(k).

Comment hidden because of low score. Click to expand.
0
of 0 vote

"infinite points"? If that means very large n, you can do O(n) by partitioning.

Comment hidden because of low score. Click to expand.
0
of 0 vote

en.wikipedia.org/wiki/K-nearest_neighbor_algorithm

Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

### Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

### Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

### Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

### Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More