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.
@coded : your solution is partially correct. Consider the case when the data present in larger array is random order.
- vipin3105 March 25, 2012E.g. bigger array ---- |1|2|E|3|E|9|
Smaller array ---- |5|4|
E--Empty space.
In the above case this algo wont work.
What we can do is that
1) Shift all the content of the bigger array to right end. And keep track of the place where the data starts filling up.
2) Now compare the string from starting and place the smaller number at the first position in bigger array.
This technique is similar to merge sort.
Plz let me know if you have better idea or there is any issue with the algo provided.