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.
While enumerating the matrix through a nested for loop , doubly linked lists can be maintained to represent the rows and columns which would be very easy to reverse.
- Anonymous September 19, 2012So basically all possible words can be found in n^2 complexity
Let me know if this is correct , I would want to actually code it , if this is the right direction.