Okay thank you I didn't expect that honestly doesn't make much sense to me, but I'll figure it out

My program times out even though I have time complexity of O(n) anyone have any idea, do I need a time complexity of O(logN)?

I looked up how to do this since I haven't taken calc yet in highschool and I still have no idea how to do this...

Yeah nevermind I was iterating through it from left to right not from right to left mb

java

I got it, two divisors needed

Doesn't matter if wikipedia says so I mean it just isn't like I got the right solution I just don't think the test cases should be like that

I don't understand the modulus or remaining end part like for some of the tests it's asking for true even though it is false a credit card number
since their remainder != 0

Why doesn't the count method work if it's a negative value? like you'll just return 0 not a negative number in the test cases

This doesn't feel like a lvl 7 kyu question but I like it :)