my brain hurt bro,what is going on,wth man
ok i got it but i forgot the(start,stop,step) XD

man,really really thank you, i get it now.

because it refers to step. range(start, stop, step)

why you repeat x? can you explain pls, i don´t get it.

This is an old comment, but just in case someone else is puzzled reading it... The % operator in C and C-based languages like C++, Java and C#, is not a true "modulo operator". It's a remainder from integer division that truncates toward 0, so that nonzero values of x % y will have the same sign as x.

Many other languages use a remainder from floor division, where nonzero values of x % y have the same sign as y. So n%10 always gives the least positive remainder from dividing n / 10. In this case, that makes:

-1 % 9 == -1  .... in C, C++, Java, C#
-1 % 9 ==  8  .... in Python, Ruby, APL 

This problem is one of the rare cases (in my experience) where C-style remainders simplify code. Usually there's no difference, but when there is I find that I have to adjust for the difference more often in C than in Python or Ruby.

What is more performancy - list() or [for in]?

how is it working can anyone explain that function?

The solution should be static.
Missing Java example in the description.

Nice! I like how it's simple yet understandable on a first read through.

oh, that is weird let me know if you figure why that is

Oh snap... My bad. Just re-tested it on Java and it seems fine.

However, writing the equivalent function in Python seems to spit out 9 for input = 0. That is strange and makes me wonder how different languages implement modulo operations. Very trippy.

Sorry to the numerous warriors who were alarmed by my ignorance! I only cared to quickly test it in Python.

Again, apologies!

What are you talking about? I just tested with 0 and it passes just fine.

This is actually wrong. If the input is 0 the answer would be 0. But this would spit out 9 if the input is 0.

I suggest the numerous authors to revise this solution by adding an if statement for the special case 0.