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.
Can we do it this way :--
- gg August 11, 2013(I m assuming that we know the number of nodes in the list. If not we can find it easily using cycle finding algo in the list.)
1. Simply delete the required node first as in SLL.
2. Now we know how many nodes remain in the list. Based on this restore the last node pointer which is pointing to the middle node.