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.
One more approach will be similar to printing the last n node of a single linked list. Use 2 file pointers(fp1 and fp2). Move the first pointer(fp1) n rows or till the end-of-file whichever comes first. If there are more that n lines in the file then start moving the 2 file pointers till fp1 reaches the end of file. Once fp2 reaches end of file, then move fp1 till the end of file printing every line and this gives the last n lines in the file.
- Emmkay November 12, 2012