Interview Question

Country: United States

Comment hidden because of low score. Click to expand.
of 0 vote

How optimal do you want? This could become very ludicrous if so desired...

Rough algorithmic approach:
1. Compute the distances from Jerry to all cheeses, all cheeses to all other cheeses, and all cheeses to Jerry. Guess to be O( kNM) complexity with O(NM) memory
2. Iteratively search for pathing between all the Tom->cheeses->Jerry. This would be O(k!) complexity with O(k) memory for OPTIMAL solution. I'd probably forgo the optimal solution here and use something more easy to compute like using a Genetic Algorithm, ACO, or (egad) greedy if k is expected to be larger than 20.

- zortlord August 18, 2015 | Flag Reply
Comment hidden because of low score. Click to expand.
of 0 votes

There's an optimal O(n^2 * 2^n) algorithm for step 2 that's based on dynamic programming (state is combination of current location and the subset of cheese locations that are visited). That should be able to cover slightly larger cases, but still not very large.

- Anonymous August 28, 2015 | Flag

Add a Comment

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.


is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More


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.

Learn More

Resume Review

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.

Learn More

Mock Interviews

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.

Learn More