CareerCup

  • Questions
  • Forum
  • Resume Tips
  • RSS
  • Sign In

Yahoo Interview Question for Software Engineer / Developers


More Questions from This Interview



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

Seems to be straight forward. Is there any run-time criteria.

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

lets assume intervals are given in following form: [start,end].
check every interval such that end >=element

complexity O(n)

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

if the intervals are sorted it will be O(log(N))

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

Consider all the start and end points in the intervals as elements of a sorted array. Now simply apply a binary search on it. o(n log n)

This is of course assuming that the intervals are given to you as sorted.

- chandransuraj February 08, 2011 | 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