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.
You're gonna need to do this recursively, because you need to traverse the linked list all the way to the end, and simply call back to the original function that changes links. You cannot do it while traversal is the limitation added by the use of single pointer.
- PrateekS. December 01, 2013node* Reverse(node* List) { if(List == NULL || List->next == NULL) return List; // if list is empty or its the last node node* temp = Reverse(List->next); List -> next -> next = List; // Form a loop List -> next = NULL; // Eliminate loop by deleting one link thereby reversing the direction return temp; // Recursively return the new "head" of the list }