Yahoo Interview Question for Software Engineer / Developers






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

Assuming fixed list A is of much lesser size than second list B i.e. A.length << B.length. Then we can just linearly search for each element of A in list B.
It will be optimal if A.length < log(B.length)
Otherwise sort list B, then search each element of A with binary search in B.

- Anonymous December 12, 2010 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Using hash table can be used to this problem with time complexity of O(n) where n is larger among length of two list.

- vivs0766 July 26, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Hash table can be used to this problem with time complexity of O(n) where n is larger among length of two list.

- vivs0766 July 26, 2012 | 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