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.
So, assuming the points have x and y coords and the destination is always reachable from the source (simple check that x,y of destination> x,y source), without the special points, it would be simply a case of going right till Xcurr=Xdest and then up till you hit the destination.
- calvin.brizzi May 20, 2014With special points, the trick would be to maximize the number of special points you hit. This can be done by simply starting from your current position, using an unweighted shortest path algorithm, and finding the closest special point. Then go right until Xcurr=Xspecial and then up till you hit special, jump across, and then use this as the next source, until we find that no special point is within the bounds of having it's X coord< Xdest and it Y coord<Ydest and therefore we can just go right until Xcurr=Xdest and then go up.