The River II


Anyone else having an issue with optimization in python3?
Passes all test cases quickly with no errors and no hard-coding, yet only showing 91% completion... :frowning:
I'm failing the "yes please" test.


Keep in mind: you don't need to find the earliest starting point of the meeting rivers, you just need to check if a river exists. So consider starting with r1 and then try to find one single smaller number that leads to r1 and you are done...


I am literally way to ashamed to admit how much time i had to spend on this one..
If you are stuck like i was just PLEASE read the description from the beginning to the END and realize how simple the solution might be. My final code takes like four lines and runs in seconds. Cheers :slight_smile: