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.
Algorithm :
- Divide array into two parts : -ve and +ve numbers assuming 0 as a modified version of quicksort .
- Now we have all the positive numbers at the end of the array and all the negative numbers at the start of the array
- have 2 pointers , one pointing to the first number in the array which is a negative number and the other one to be pointing to the first positive number in the array.
- Swap the two elements. Increment positive counter by 1 and negative counter by 2. repeat
- If there are more positive numbers or more negative numbers than they will appear at the end of the array.
Java code:
Taken from : http://www.geeksforgeeks.org/rearrange-positive-and-negative-numbers-publish/
- smdmustaffa July 29, 2014