Could you try my code: https://www.codewars.com/kata/reviews/557bdf248b12b34231000042/groups/66abc1d9dfbb6d7a3e76d0c4

I'm not sure how you check speed, but I think it should be faster than either.

hahaha for real man

Yes, here and in the homepage.

I am confused, can you see the comments on solutions without being able to see the solution?

Spoiler flag, please.

Which PEP8 rule you meant?

I went through the wiki page and others and still didn't find an answer as to how "" is ENQ...

Thank you so much for asking this question @PatrickSile and for answering so clearly @agkg

This solution is brilliant. Every other solution (including mine) requires a naive search for a matching number. This one calculates it! I still don't get it though. Where did this formula even come from? Does modulus have an identity or property that's being exploited here? Why does the sum of the coefficients mod 105 have to equal 1? Why does each coefficient mod the term itself have to equal 1 (ie. why the first term is 70 and not 35)?

that trick with tuple in lambda is awesome