Microsoft Interview Question
Software Engineer / DevelopersTeam: Bing
Country: India
Interview Type: In-Person
is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
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.
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.
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.
Assuming that it is literally impossible to compare nuts vs nuts and bolts vs bolts (i.e. we cannot label them arbitrarily as a preprocess to impose a linear order), you could do the following: Choose a pivot nut. Find its corresponding bolt in O(n) time. In O(n) time partition the remaining nuts and bolts by comparing to either the partition nut or the partition bolt depending on their type. Then recurse on the two halves. This is exactly like quicksort except for the additional pass to find the bolt that goes with the pivot nut, which however does not change the asymptotic complexity.
- psykotic February 20, 2012