Очень хорошее и увлекательное Ката. Автору огромное спасибо!

If you manage to reproduce the problem, you can re-raise the issue, sharing the failing code this time so it will be easier to investigate.

I am unable to reproduce your issue. I tried your solution with mazeSplit[0] and with mazeSplit[^1] and both versions pass tests successfully.

Can you post your failing code? (remember about code markup and flagging it as spoiler).

In what language? Are you sure about that? Similar reports were already raised in the past and every time it turned out that users made a mistake when checking. How did you check this?

There are many ways to check the conditions in this solution that I didn't even think about while I was solving the kata. I'm a beginner and such solutions really help with learning. Thanks! 🤗

It looks like you're pushing Tup objects in a HashSomething, while they do not implement hashCode, so you should use something else (than the Tup objects themselves).

edit: oh, that's C#, right? I thougt it was Java. The reasonning will probably the same, tho.

The tests passed, but I keep getting this warning.

tests/Fixture.cs(125,23): warning CS0659: 'SolutionTest.RefFinder.Tup' overrides Object.Equals(object o) but does not override Object.GetHashCode()

Am I doing something wrong?

you don't need to do that tho

I used BFS too and did not have an issue with time. After all, BFS has the best possible time complexity for a graph searching algorithm.
There may be a little bug that causes your solution to loop endlessly.

What is the point of the format of the test cases? Why have the lines be joined with '\n' when we are going to parse them into a matrix anyway?

Well, today I have learned something new, which is great! Never had to deal with maze solving, so I had to google algorithms for that and figure out ways to implement one of them.

In Rust.

In which language?

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