https://www.lintcode.com/problem/611/description The idea of this problem is simple, from the source, do a BFS and find the shortest path to hit destination. Let’s take a look at the solution: