PYTHON

This coding question involves coming up with a solution to a maze.

A maze is specified as a 2d array, with elements '0', '1', 's', and 'e'. 's' is the beginning of the maze, 'e' is the end of the maze. '0' represents a space that can be passed through, '1' represents a wall.

INPUT =["s", "0"],

["1","e"]]

Find the length of the shortest path from 's' to 'e', or -1 if there is none.