A maze question, similar to leetcode 62/63, a two-dimensional array, giving a starting point and an ending point, asking for the existence of a path from the beginning to the end (implement api). 1 in the array represents an obstacle and cannot go. 0 means that it can pass.

But I cannot use dp or dfs. Do it using bfs. The interviewer also said something about two bfs. Any idea how to solve this guys?