So Dijkstra's algo? Then if I undestand correctly, we need to write the algo here in this kata?

#Language:Python
#Path Finder #1
#https://www.codewars.com/kata/path-finder-number-1-can-you-reach-the-exit/
I have been trying all day, can't seem to figure out the algorithm.
Can I get a hint somehow? I don't understand how to get the right algorithm

Python

There should be another couple of tests like:

1. [[]] and [2]
2. [2] and [[]]

Because I wrote a conditional where it checks if the first item in the original list is a list and it passed the first test above and failed the second. Although it should have failed both the tests above.
The problem was that this conditional assumed that the first item of the second list was also a list even though it wasn't.

Oh, I see it now. They are three elements in the list. I saw a similar issue downstairs, but couldn't realise it.

What should this test case return? True or False?
For me, it returns False. And when I try the reversing the list and then checking the structure, I get an error there.
I am not sure how to handle this. I raised an issue, but maybe I misunderstood?

The last test fails:

Testing to see if you tried a certain short-cut
[1,'[',']'] same as ['[',']',1]: False should equal True

So, that means the solution should also consider arrays with similar nested structure when run backwards.

But if I modify my solution to accomodate that, I get an error for this test:

[1,[1,1]] not same as [[2,2],2]: True should equal False

What's going on? What am I missing?