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.
There seems to be a problem with the mechanics of the question.
- rahulrajaram2005 July 20, 2013- You want to start at (0,0) and go to (m-1,n-1) in a m by n grid.
- As per your question, on seeing a 1 you can move left or down and on seeing a 0 you can move only down.
- The problem with this is that you are never able to move right and you may never reach (m-1, n-1).
So , the second part of your question ought to be something like this :
Given, if the element is 1, we can move LEFT or DOWN, if it is 0 we can move RIGHT or UPWARDS.