In Rust.

In which language?

The ninth fixed test has an extra character in the last row, which makes it not a grid.

To whoever reads this and hasn't solved yet: don't bother trying this without knowing theory from CS textbooks. you will waste time, and you will fail. start by googling the term "stanford CS106B maze". if you are discouraged, remember that this site is nothing more than homework problems from first and second year computer science.

above (revised) code passes; possible cout formatting in the browser misled me earlier... closing now, thank you!

No need to for now, but posting your code (properly formatted) would help. Do you know how to use code formatting with Markdown?

C++. I have screenshots of the test runs with dumped mazes, to demonstrate this cases, which I can post (somehow) if anyone's interested.

In what language?

I am seeing test cases that are not NxN, and test cases where there is no possible path to the exit, but the test validator returns true.

Declaring what the type of 'maze' is would be nice. Also, I see most (if not all) solutions split the string into lines by '\n'. A list of lists (or at least list of strings) is easier to work with and makes much more sense in a task like this.

I think |0 is shorter and less confusing for flooring than >>0

make it maze=="." it works for me

chatGPT probably got the answer from you!

that answer is from way before chatgpt was a thing lol

nice use chatGPT