Your question is Find All Maze Paths. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
A Verily Study Watch analysis workflow represents a coverage area as a rectangular grid. Given a maze, a start cell A, and a destination cell B, return every simple path from A to B.
You may move one cell up, down, left, or right. You cannot move through blocked cells or visit the same cell more than once in a path. Return paths in the order discovered by trying directions right, down, left, up. Each path must include both endpoints.
Implement find_all_paths(maze, start, end).
maze is a rectangular list[list[int]], where 0 is open and 1 is blocked.start and end are coordinates represented as two-element lists [row, column].list of paths, where each path is a list of coordinate lists.[] when no path exists.def find_all_paths(maze, start, end):