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.
Hi Anant, I don't think greedy approach will work here. This question is bit different from interval scheduling. In interval scheduling once one event will get completed you can schedule any event which starts after the first will end. Here we are getting additional constraint that, next city should be reachable from current city in given time. For example suppose you are at city A, there are two city B and C which can be reached from A in given time, and both has festival on next week. Suppose festival in B falls before festival in C. In this case with greedy approach you will go to city B. But suppose there is some other city D which has festival in next week (one week later of B and C). Suppose D is reachable from C in one week time but not from B. In this case our selection C would have given better solution.
- ajeetpr.singh November 19, 2014I think we need to explore all the possibility. It will be solved with DP.