Interview Question


Country: United States




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

you can use 2d tree to solve the problem in less than O(n2)

- printfbabu September 11, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Divide and Conquer : O(nlogn)

- Cerberuz September 11, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

thank you mukesh :) nice resource :)

- BeautifulCode September 12, 2012 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

cs.princeton.edu/~rs/AlgsDS07/16Geometric.pdf

- Mukesh September 11, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

What do you mean by "closest pair problem"? Closest points in 2D space? Pair of numbers in an array that is closest to summing to a target sum? There could be many things meant here.

- Anonymous September 11, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

@Anonymous
By closest pair problem we mean that we got to find the those pair of vertices out of n vertices which has the shortest distance between them.

- BeautifulCode September 12, 2012 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

You can use Floyd Warshall algorithm ,with a slight change .

- Bablu September 12, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

That's quiet interesting, can you elaborate.

- Cerberuz September 12, 2012 | Flag


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