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


Find the shortest path from Start to End points. Output the path in the maze with dots. For example

ā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆ       ā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆ
ā–ˆSā–ˆ      Eā–ˆ       ā–ˆSā–ˆ  ....Eā–ˆ
ā–ˆ ā–ˆā–ˆā–ˆ ā–ˆā–ˆā–ˆā–ˆā–ˆ       ā–ˆ.ā–ˆā–ˆā–ˆ.ā–ˆā–ˆā–ˆā–ˆā–ˆ
ā–ˆ   ā–ˆ     ā–ˆ   ā†’   ā–ˆ...ā–ˆ.....ā–ˆ
ā–ˆā–ˆā–ˆ ā–ˆā–ˆā–ˆā–ˆā–ˆ ā–ˆ       ā–ˆā–ˆā–ˆ.ā–ˆā–ˆā–ˆā–ˆā–ˆ.ā–ˆ
ā–ˆ         ā–ˆ       ā–ˆ  .......ā–ˆ
ā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆ       ā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆā–ˆ
0 characters
ARGV is available via STDIN, joined on NULL. x is a no-op.
arguments holds ARGV, print() to output with a newline, write() to output without a newline.
say() is available without any import.
SELECT arg FROM argv to access the arguments, only the first column of the first result set will be printed, NULL values will be skipped, and the dialect is SQLite.
ctrl + enter or Run