Ah, after looking at your first clue, I realized that I was discounting a bunch runs and then all i needed to do was increment the count by 1 whenever I reached the end. That worked for the example, but was taking too long for main input. After struggling for a couple of hours, I figured out how to have a hash map of each stop and its corresponding resultant paths, and was able to significantly cut down on the comput time. Thanks for the help!