Given a two dimension array, if there is a path that can from top left to bottom right (1 means obstacle), this one is not hard.(bfs)

Follow up, what if the maze is very big, the size is millions, how to do that? bfs might blow out, is there any other approaches?

Update: Is Bi-directional BFS a good way?