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.
A funky sort algorithm that spits out any duplicates and runs in O(n):
Start by swapping out an element (arr[x]) with -1.
Take that number (temp) and swap it into its sorted location(arr[temp-1]).
Repeat while we don't get -1 back and don't find a collision (temp == arr[temp-1]).
If we find a cycle, -1 will be back in temp.
If we find a collision, the duplicate number will be in temp. Print it!
At this point you can break but I keep the funky sort going just for fun.
Enjoy!
Java
Edited for whitespace!
- Awesumness February 14, 2012