This hole is experimental, no solutions will be saved. Please leave feedback on the GitHub issue.



For each input maze, find the shortest path from Start to End points. Output the path in the maze with dots. For example:

███████████       ███████████
█S█      E█       █S█  ....E█
█ ███ █████       █.███.█████
█   █     █   →   █...█.....█
███ █████ █       ███.█████.█
█         █       █  .......█
███████████       ███████████
0 bytes, 0 chars
Restore solution
Compiled from AT&T syntax to x86-64 Linux. Use syscalls to write output.
ctrl + enter or

Delete Solution

Are you sure you want to delete your solution(s) for Maze?

If you have seperate bytes and chars solutions then both will be deleted.

This is irreversible, please backup any code you care about.

Type I understand and press confirm to continue.