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.
BFS won't solve the problem.
- rahul8805 October 21, 2013There is a simple recursive solution to it...
A knight can move in one of the possible 8 ways from its current location:
i+2, j+1
i+2, j-1
i-2, j+1
i-2, j-1
i+1, j+2
i-1, j+2
i+1, j-2
i-1, j-2
After checking the bounds of the chess board for every move, do a recursive search on each of the 8 directions. As you make every recursive call, do some book keeping to store the points. In this way, once you reach your target, you have a list of points that led you to this point.