implemented with both Java and Python by Depth First Search.
Given a maze with 0s and 1s where 1 means wall and 0 means path, an initial position, and an ending position.
Output is whether there is a path from two points in the maze. (True or False)