• Sightstonecommented on "Baby Magpies" javascript solution

I'm not mad btw, just asking. What is the point of submitting a minified solution?

• ssrwuhancommented on "MakeUpperCase" javascript solution

This comment is hidden because it contains spoiler information about the solution

• MrLootmancommented on "Double Char" javascript solution

This comment is hidden because it contains spoiler information about the solution

• napalmtangocommented on "Double Char" javascript solution

This comment is hidden because it contains spoiler information about the solution

• gentoosiastcommented on ""AURUM RECLUDIT CUNCTA"" kata

Really hard puzzle, 5kyu is underestimation. Only 35 solutions since 2017.

• KatlehoMadabacommented on "MakeUpperCase" javascript solution

arrow functions :)should have thought of that cool

• dannykryancommented on "Double Char" javascript solution

that's very tidy!

• Jesse-06commented on "MakeUpperCase" javascript solution

Nicely done. Arrow fuctions are ideal for one-liners.ðŸ”¥

• Prince Vaghanicommented on "Double Char" javascript solution

nice solution

• skr0nkscommented on "Double Char" javascript solution

very nice solution!

• hobovskycommented on "-Reverse it, quickly!" kata

Retired as per following discussion: https://github.com/codewars/content-issues/issues/158

• mdobrychlopcommented on "SQL: Bytes in String from Ints" sql solution

This comment is hidden because it contains spoiler information about the solution

Voov Great!

• rese2112commented on "-Reverse it, quickly!" kata

I found the bag For code weirdReverse=a=>a.sort(_=>-1) i got error weirdReverse([1,2,3,4,5])
Should return [5,4,3,2,1]
Array must be reversed - Expected: '[5, 4, 3, 2, 1]', instead got: '[1, 2, 3, 4, 5]',
but my code RETURNS right variant in my IDE.

• jpssjcommented on "-Reverse it, quickly!" kata

Hi. Ok, I found this one by chance, but I don't really understand how it works under the hood. Does this syntax define the first element as the maximum of the array with indices from `0` to `n-1`, then the second element as the maximum of the subarray with indices from `1` to `n-1`, and so on up to `n-1` ? Could someone please explain/confirm it ?