recursive nightmare :D

kudos if this was on purpose, else i recommend checking out regexp :)

can someone help me calculate Time Complexity for this?
We have 3 loops:

1. for-loop over m.length -> O(m.length)
2. for-loop for every range in m -> O(m.length * m[1]-m[0])
3. indexOf until first match or end of arr -> O(<m.length)

idk how the notation goes, but this is my best guess.
Please help, because i would like to learn :)

hahahaha, thank you for the laugh, this is also one way to do it, just hack the math.random function and manipulate the test cases, hahaha

i can't believe i wasn't able to find this solution...

kudos to you

This solution works but took 9s for the big maze test case (which is close to the 12s limit);
so there is room for optimization, would like to hear some nice suggestions :)

how does this work? please explain

resubmitting 5 times, did not work...

last test fails, even tho it works locally when i copy paste inputs for the last test (the one with 300 nesting)

3h wasted damn...

please fix...

need hints how to solve this, i am a programmer not a math geek :(

it should note, that start is not necessarily on the top floor

interesting, in my first attempt i had this same soluton but it timed out for me

-5 and you save yourself 5 F characters ;)