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.
1. Create an array of size N ( indexing 1 to N ) with all entries as zero.
- Jose August 20, 20122. Scan the input and ignore the input if it is
a) less than 1
b) greater than N
3. Otherwise, set array[input] = 1
4. In the end, return the first index with a zero value. If all entries are 1, return N+1.
Note: We don't have to find the maximum of elements as some people have suggested. If it is greater than N, it will create a hole in the range 1 to N, which we are trying to find out. The worst case will be the input will be a permutation of elements 1 to N.