A minimum cost path traversal problem
Anonymous
I suggested a DFS solution, but the interviewer wanted a more optimized solution. So I proposed a simple Dynamic Programming approach, which satisfied him.
Check out your Company Bowl for anonymous work chats.