• ###### LJ3Dcommented on "Simple multiplication" cpp solution

writing asm to solve an 8kyu C++ problem, absolutely based.

• ###### manikarancommented on "Simple multiplication" cpp solution

okay, this one wins

• ###### manikarancommented on "Convert a Number to a String!" cpp solution

this is not a function technically

• ###### krnetscommented on "Simple eviternity numbers" cpp solution

Superb solution.
And thanks for such clear explanation (very rare to see).

• ###### awesomeadcreated a suggestion for "Flood Fill" kata

Is it intended that the passed in array be modified in place? That's what the top solutions are doing. Typically this is considered bad practice. Given that the method has a return value, one would assume that this is an oversight. Maybe the description could explicitly state that this shouldn't be done (if that is intended).

• ###### mateuszmachetacommented on "Sum of Triangular Numbers" csharp solution

No, there are many ways you can come up with solution. If you have time to research and use simple formula then I guess that's the best. But if not then you have to work harder on your code.

• ###### chris_wcommented on "Esolang Interpreters #4 - Boolfuck Interpreter" cpp solution

While this works with all of the test cases, it limits the tape to 30,000 whereas the requirement was that the tape be infinitely long (though obviously it'll be limited in practice by memory). To be correct, the tape should be extended dynamically in either direction as required.

• ###### chris_wcommented on "Simple consecutive pairs" cpp solution

If `arr` has an odd number of elements then this code invokes undefined behaviour by accessing past the end.

• ###### chris_wcommented on "Simple string matching" cpp solution

This incorrectly returns `true` for cases where the substrings exist but in the wrong order (though there doesn't seem to be a test case for this). For example:

``````solve("wars*code", "codewars") // true
``````
• ###### chris_wcommented on "Simple string matching" cpp solution

This incorrectly returns `true` for cases where the substrings exist but in the wrong order (though there doesn't seem to be a test case for this). For example:

``````solve("wars*code", "codewars") // true
``````
• ###### yar83commented on "Switch it Up!" c solution

So do I, but thought about my mental boundaries hurts.

• ###### LesnyRumcajscommented on "Subtract the Sum" cpp solution

I died a little inside.

• ###### josuezorrilla23commented on "Sum of Triangular Numbers" csharp solution

I did not know the formula for this problem. Im a bad programmer because of that? Any advice for me? thanks for the solution!

• ###### Voilecreated an issue for "Graph Theory: Detect an arborescence " kata

Your `IGraph`/`Graph` doesn't even implement `IEqualityComparer` or `IEquatable`. How are you going to determine if two nodes are the same then?

• ###### Voilecreated an issue for "Graph Theory: Detect an arborescence " kata

We're not provided the total amount of nodes in the graph.

What if there are more than one connected components?