Oracle Interview Question
Software Engineer / DevelopersCountry: United States
Interview Type: In-Person
is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
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.
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.
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.
We need k-nearest neighbor search methods. If it's always 10 may be we can use some fancy algorithms, but in general kd-tree or locality sensitive hashing (LSH) would be a good option, specially with the assumption that the world is a 2-dimensional flat surface. Don't know about the complexity of LSH, but kd-tree can be used to find "the" nearest neighbor in O( log N ) time. For the remaining (k-1), I guess in total O( k log N) will do (not 100% sure).
- lasthope November 19, 2013