Well I would assume that your output is different from the correct result at position [0][1], meaning first row, second column,
but im not 100% sure.

Thank you very much for this elaborate code!!

It helps so much, thank you a lot !

izi

Actually a nice Kata, i appreciate every (differential) equation solver stuff here on codewars, but the focus on that weird error calculation combined with that truncating makes this kata a rather painful experience.

After i wrote my code I was pretty sure that the Euler worked as intended, but the tests failed, so i just plotted the results and compared it to the solution of many different ODEs and the Euler solver was correct.

Maybe one could omit this weird truncating in this exercise to make this kata more pleasant.

dude, i think it is server problem.
i passed all the tests, but i tried to attemp, got time out problem.
after i saw the solution, copied and past it got time out problem:D

The problem was that the 3rd test-case caused my while-loop to run infinitely, all other test-cases were fine,
and i was surprised that the first 2 test-cases were not shown as "successfully tested" because the 3rd test timed-out.
thank you and im sorry !

There will also be lists tested of lengths upwards of 10,000,000 elements

Not an issue.

Wow, thanks for the reply! I didnt know other people can see my solution, that's embarrassing for me :D

You are completely right, i took out all the unnecessary lines and it only took 11086 ms, so almost a whole second below the 12 s.

Your code is just barely fast enough to pass with luck, are you using unique_letters_of_s1_and_s2 at all? Even O(n) solutions are passing slightly below the 12s timeout limit.

Possibly related to #757

a