Google Interview Question

Dynamic programming square where 0 indicates wall and 1 indicates pathway, move from 0,0 to n.n