It's been a while but all the words are split, so you'd need to do it for every word separately.

Alright i figured it out. Thanks for the help. Now i am just way too slow, so i hope i can shave down my time.

I'll look into that. But shouldn't the test then expect an error instead of a result?

Fixed test 38 i get Error Detected: Expected - [[10, 7, 570]], but instead got [[12, 7, 582]], which i don't understand because when i print the board when the move(2000) comes in and i count all the integers in the board, i count up to 582, which my solution returns as the end size of the final blob, but the solution is expecting 570, which should be impossible since all blobs summed up will give 582. And if i try to print something in the populate function, nothing ever prints on that test so it never gets called? Besides my populate function misbehaving, i doubt my code is doing something wrong since all the other fixed tests run fine... Could someone give a little advice what is going wrong?

Nevermind i just finished it!!!

5 or 6 hours across three days and i get Passed: 23 Failed: 11. Fire drill is killing me now and the random tests. Can't figure out what the queue must be for the fire drill and what the capacity is to give that result to test it. Is this too long to spend on this?

I was having so much fun creating all these -nacci function and making something that works (i think), but you ruined it by making it about performance. So annoying. I spent a lot of time on this, but i can't finish it because it is too slow apparently...

t's still quicker than mine.

Compared to my solution this one is so beautiful and amazing! How did you even figure that doing it like this would work? Even after going through some array sizes on my own to see how it works, i still don't really understand why it works the way you want. I just can't figure out why it goes from taking the last of every column to going to entire roes and how the one you want is alwasy at the back... Does this mean i will never reach kyu 1?? :(

I keep getting timed out. As an example for the following list [10, 5, 2, 3, 7, 5] i make a variable first = 10 and i then have a while loop that checks 10 against every next character until it finds a pair that adds up to the correct amount. If it doesn't find a pair, the first character will go up to the next character, so first = 5 and go over the entire rest of the list again. So i do one entire loop for every number in the list except the last one, but stop once a match has been found and the index of the first number in that pair is equal or bigger than the second numbers index. Any hints if this can be done better for 10,000,000 items? I need to go through the entire list for every number until a match is found no?