• ###### dmitrokozcommented on "Valid Parentheses" java solution

It is clever, but not the best solution as no one understands with a brief look what's going on.

• ###### yLaWyresolved a suggestion on "Page replacement algorithms: FIFO" kata

Fixed, thanks for pointing that out

• ###### MukhailoKcommented on "String repeat" java solution

you are lost final XD;

• ###### ParanoidUsercreated a suggestion for "Page replacement algorithms: FIFO" kata

nitpick: a minor typo in the descirption `to represent empt[I]ness`

• ###### SilverSabre92commented on "Does my number look big in this?" java solution

Holy smoke.... this is genius code x.X

• ###### Dark_Fontycommented on "Enumerable Magic - Does My List Include This?" kotlin solution

Nice solution

cool

• ###### Xan Xan commented on "The Culling of Stratholme" java solution

I have not seen such a method in any book, even searches on the Internet have not yielded results.

• ###### Xan Xan commented on "The Culling of Stratholme" java solution

where do you find all this? XD

• ###### CodingBotcommented on "More Zeros than Ones" java solution

Woah! can you explain so i can learn

• ###### hobovskycommented on "Factorial" kumite

What will happen in if `n` is 0?

• ###### Al3xCaliburcommented on "Factorial" kumite

It is a nearly perfect solution.
You can be a bit concise by using the reduce method instead, because it uses the first value which is identical here.

``````fun fact(n: Int): Int {
return (1..n).reduce { acc, i -> acc * i }
}
``````
• ###### Xan Xan commented on "ROT13" java solution

here indexOf does not reduce the speed too much?

• ###### TadaHrdcommented on "Make a simple calculator" kumite

You fork it (The button on top right) and then you can run it.

• ###### DangerousDarkEspeoncommented on "Will you make it?" java solution

For what reason was static removed? How does that help?