Wow, I've completed 3kyu's I've had less trouble on. Was hoping to do a quick puzzle before bed but stayed up half the night trying to figure out what I was missing. My misconceptions before I started googling around were:

1. That the fib%n sequence can be calculated the same as the fib sequence. I spent resources tracking the fib sequence in all its glory,
   and then modularing that answer to get the %n sequence.

2. That in the thousands of numbers in a sequence, 0,1 will never repeat itself within the sequence. Spent a lot of
   time trying different comparison depths, first tracking that the whole sequence repeats itself at least 3 times, then twice,
   then that 10 numbers repeat, that 5 numbers repeat... all of which worked but were too slow. Even scanning through the wiki it
   never specifies that 0,1 was guaranteed to never repeat itself, unless I missed it.

I agree with some of the previous comments about this getting a performance tag although I've seen your previous agruments for why not. Being ranked 7kyu I also wonder if the above were problems for others, and that maybe there should be hints regarding the above, but perhaps that gives too much away.

Just running attempts, this does seem to be faster. Time: 2927ms Passed: 306 Failed: 0, vs 4000ms - 8000ms for some other random solutions here, seems on par with the most clever. Sorry, kinda proud of myself, haha.

Well, submitted this accidentally when trying to retest it.... its not perfect, it will fail with a few certain big random numbers, but half the time it passes all tests.

I actually suggested that to the author to be consistent with the input/output capabilities of the original implementation. Makes me wonder whether there could be more done on the more modern Node.JS implementations.

Yeah, just caught that and submitted new code. Thx.

You've misread the spec for stn.

Interesting problem, but most of my time was spent trying to figure out what it was asking rather than actually solving the problem. Perhaps its needs a more clear declaration of what its requesting. It also discusses the importance of the 'type' but then doesn't use it. Tests allow solutions that index graph arrays with index rather than by a graphs ID because tests use ID's of 0 or 1 in order, so graph ID 0 is always at array index 0, and others issues. But did enjoy solving it, definitely the intricacies of adding-to or creating objects as needed.

Mean... but interesting. I just couldn't resist killing the time required to figure out what was going on here. Probably not as much time as it took to insert 1000 HelloWorlds into this code though. Glad I now know.