• ###### glynestercommented on "sort array by last character" javascript solution

Well clearly I should have sorted by index afterwards. It doesn't explain why my solution (prior to fudge) worked on arrays <= length of 10.

• ###### glynestercommented on "Minimum Number of Coins" kata

Fun kata! :)
My initial solution would occasionally fail some of the random tests although I could have submitted it. But of course it's hard to design testing to cover every eventuality especially where the test input can be as varied as this.

• ###### RealKenshirocommented on "Slay Achilles!" kata

1000 = 2^6 * 5^3 = 4^3 * 5^3 = 20^3 -> 'not Achilles' -> don't remove!

2^5 * 3^2 * 5^2 -> 'Achilles' -> remove!

• ###### glynestercommented on "Algorithmic predicament- Bug Fixing #9" kata

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

• ###### glynestercommented on "JavaScript seems to be broken" javascript solution

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

• ###### glynestercommented on "Socialist distribution" kata

Fun kata!
Ideas for future kata: oligarchy, benign dictatorship, capitalism, anarchy...

• ###### glynestercommented on "Most consecutive 0's in a row [Code-golf]" javascript solution

Clever regex!!! :)

• ###### glynestercommented on "Obtaining the String" javascript solution

I shall have to change my style and use curried functions more often!

• ###### JohanWiltinkcommented on "Obtaining the String" javascript solution

I like currying! :]

Partial application is often a lot cleaner than endless fat arrow wrapping.

• ###### glynestercommented on "Obtaining the String" javascript solution

I like the callbacks on the filter(s)! :)

• ###### glynestercommented on "1 Two 3 Four 5!" kata

This might have been a reasonable kata if the explanation was a bit better.

``````Test.assertSimilar(conv(15795379351687), "15795379351sixSIXsixSIXeightEIGHTeig7")
Test.assertSimilar(conv(157953793516872), "OFISEVNINEFIVEfTHREEtSEVENseNINEnineTHREEthreFIVEfiveFIONEoneONEon68SEVENsevenSEVE2")
``````

"Strings alternate in type cases: starting in lowercase to uppercase and so on based on position." <= From instructions

Can anyone slowly explain how the sentence case is calculated for the above 2 tests?
For example, why doesn't it switch at the beginning of the 2nd test?
This is what I get:
OfiSEVnineFIVEfTHREEtSEVENseNINEnineTHREEthreFIVEfiveFIoneONEoneON68SEVENsevenSEVE2

The string length is odd so the rule "starting in lowercase to uppercase" is reversed so you start in uppercase.
Then I alternate the case for every new digit and "within" (e.g. sevenSEVEN ) the digit if the number word requires more than one word.

My text output is fine; just the sentence case is wrong in some instances.

• ###### dfhwzecommented on "Texas Hold'em Hands" kata

 comment outdated

• ###### glynestercommented on "Texas Hold'em Hands" kata

Okay I guess there is one card left to make up the player's hand but I believe I have clarified things for the non gamblers amongst us! :)

• ###### dfhwzecommented on "Texas Hold'em Hands" kata

Ok C# it is then.

• ###### ejini战神commented on "Texas Hold'em Hands" kata

Like me XD ~~