I solved it with using replace with regexp. However I am still confused why there was error with toUpperCase function called. There is only string as input as I need to dig this deeper.

Same problem

Yes but you cook pancakes one side at a time, so its not the number of pancakes you're cooking; it's the number of sides

hi how did you solve this problem

I'd argue that in Python and JavaScript, this Kata is impossible to solve with just the sample tests.
All other languages have more examples, which also include unintuitive cases.

I've added some additional tests here:
JavaScript fork
Python fork

This kata (perhaps) needs some kind of warning against the obvious failed logic of the surface expectation. There's a small chance this warning will prevent the repeated rage posts about how a kata that has been solved a thousand times is "impossible" to solve.

Then again, maybe it won't.

Your self-assurance is admirable. It is also unreasonable.

Yes i agree the kata is flawed for this. I commented this and others replied telling me i was wrong but i am certain the kata is flawed

This Kata is a flawed one. Does not take in account for the cases where n is greater than m but the last batch is considerably smaller than m. Expects the answer to be an odd number when each batch takes 2 minutes for each pancake to cook.

I would love to solve 1000 more 6kyus like this one.

I'm having the same problem, perhaps you could make a specific statement that checks if it is this string and return false? But for real, not sure why this is happening.

So am I.

Should look at the resulting length.: False should equal '#ABbCccDdddEeeeeFfffffGggggggHhhhhhhhIiiiiiiiiJjjjjjjjjjKkkkkkkkkkkLlllllllllllMmmmmmmmmmmmmNnnnnnnnnnnnnnOooooooooooooooPpppppppppppppppQqq'

The test keeps failing with the error message below. The string above is also 140 chars only. So, why the testcase is not passing when I have the condition to test the string length.