StartUp Interview Question for Java Developers

Team: 5
Country: switzerland
Interview Type: In-Person

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

1. Create a BST of 2nd list
2. Now, for each point( let it x) of first list, get two values, x-radius(A) and x+radius(B)
3. Now, get points greater than A and less than B.
This can be done by reading left subtree of B in right subtree of A for each X.

nlogn ( creation of tree)+
n ( calculation of A and B) +
nlogn (locate A) +
nloga where a is number of elements in right subtree of A (locate B in right subtree of A) +
traverse left subtree of B.

- himanshu.rawal19 December 09, 2014 | Flag Reply
Comment hidden because of low score. Click to expand.
of 0 vote

What is a fast algorithm in the question? What does it refer to?

- akshayrajkore January 11, 2015 | Flag Reply

Add a Comment

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


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


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