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.
This is in reply to zortlord's comment. If I am not mistaken, the worst case complexity of A* is O(E), the same as of the BFS. It is true that A* may be faster on average for 2 points, but (a) we have to find the distance between 1 and many points, and (b) the path finding itself is not bottleneck here, the TSP is.
- emaz.ip November 08, 2014Also, the complexity of Held-Karp algorithm solving TSP is indeed O(n^2 2^n). O(n!) is the complexity of the most straightforward approach and Held-Karp is much faster.