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.
First find the middle node in the list
- moron August 09, 2013Make count no of elements on left and right of middle node (Node_left, Node_right)
(Node_left, Node_right) could be equal or Node_left = Node_right-1
Now when delete the random node in the list check if it is right or left of the middle node,
and change this count
on the basis of this count you have to then move middle right or left
if(Node_left < Node_right-1 )
move right
else if(Node_right <Node_left)
move left