• ###### VillereVcommented on "How many Katas should I have done?" csharp solution

@Kartoffelsalat Could you explain what is happening here?

• ###### steffenkamecommented on "Did I Finish my Sudoku?" csharp solution

Many people say the code is clever, but it is just wrong. Be careful my friends.

nice kata!

• ###### mkubtcommented on "Dictionary Merge" kata

There is a typo (one paranthesis too much) in the example in the description:
It should be: {"A": [1, 3], "B": [2]}

• ###### 1Stascommented on "English beggars" javascript solution

Не надо так много думать))

so clean

• ###### a.vadimcommented on "English beggars" javascript solution

Hmm. My solution is very similar, but I found that for `n = 0` it returns `[NaN: NaN]`. So I added an extra check for zero `n`.

But now I discovered that such a solution is successfully passing the tests. It's interesting.

And it looks like it is not a test case problem. It's a problem with the `Test.assertDeepEquals()` function.

``````let arr = [];
arr[NaN] = NaN; // arr = [NaN: NaN]
Test.assertDeepEquals(arr, []); // --> Test Passed: Value deep equals []
``````
• ###### danielzaiser91commented on "Error correction #1 - Hamming Code" javascript solution

smart use of sort and destructure of function parameter, i have a very similar solution

• ###### MHFcommented on "Take a Ten Minute Walk" csharp solution

This works fine when the walk length is exactly 10 (which I appreciate is the length given in the instructions). However, it would be risky for future updates if (for example) the walk length were to be increased.

• ###### bakunovdocommented on "Larger Product or Sum" javascript solution

Because "product" is a multiplication operation, and it must start with 1

• ###### OCompiledcommented on "Larger Product or Sum" javascript solution

great solution, in the product part why is there a 1 at the end?

• ###### RoXTarcommented on "Sudoku Solution Validator" csharp solution

i have my solution! My message is, that this solution here is a Fail.

• ###### zombiblycommented on "Sudoku Solution Validator" csharp solution

You could take a .Distinct() of row, column, and 3x3 square to make sure you have 9 distinct values. This would also allow you to verify each number is within the 1-9 boundaries.

• ###### RoXTarcommented on "Sudoku Solution Validator" csharp solution

this Soltion lags with the following (only fifth, or 9,9,9,9,2,2,2,2,1)

• ###### vgmikhailovcommented on "Did I Finish my Sudoku?" csharp solution

Unnecessary linq. Too greedy for this simple task.