Adobe Interview Question for Software Engineer / Developers


Country: India




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

I think the best approach here is to implement Kruskal's algorithm using Union-Find data structure and stop when a subtree has 4 points.

- Mihai February 21, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

This can be solved using greedy approach. Generate a graph using points with the edge values as the distance between the vertices. Using min head data structure select the point with minimal edge cost and greedily select the other three points closest to the initial point. The cost is exponential.

- Bala December 27, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

time complexity is n^2 for ur algorithm .......can u tell the algorithm for with nlogn complexity

- satheesh January 08, 2013 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

What does closest to each other mean .. minimizing sum of pairwise distance ??

- Cerberuz December 27, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 2 vote

I guess this belongs to computation geometry filed. if in 2D, find the smallest circle with 3 point on it. in 3D, find the smallest sphere with 4 points on its surface. something like Voronoi diagram and Delaunay triangulation could help?

- Jacques January 01, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

triangle based pyramid

- mohammad husain January 18, 2013 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

in this problm we hav to select a point from which we have to select the nearest point....

- justchill January 18, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
-1
of 1 vote

Its a triangle based pyramid only

- moh January 18, 2013 | Flag Reply


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