spoiler! x/

• ChristianECoopercommented on "Count characters in your string" python solution

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

• erayzekicommented on "Count characters in your string" python solution

why do you think it is more efficient? this function you use is probably doing the same as for-loops answers...

• anter69commented on "Calculate BMI" python solution

`*2` is not the same as `**2`

• valo.pycommented on "Calculate BMI" python solution

I literally had this exact same code and it kept telling me that "Obese" should equal literally every one of them... :S

• anter69commented on "Beginner - Reduce but Grow" python solution

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

• luzycommented on "Beginner - Reduce but Grow" python solution

why use mul instead of explicitly multiplying out?

• anter69commented on "Beginner - Reduce but Grow" python solution

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

• ZerefDragneelcommented on "Beginner - Reduce but Grow" python solution

What that 1 do?

• pinkspider1995commented on "Count characters in your string" python solution

this kata should be evaluated as 8ky somehow

...

• Sanjay_Swaincommented on "Count characters in your string" python solution

Well according to me you can. Just because python gives us much freedom. So you can complete the problem in a number of ways. This is one of them... Also it is much more efficient to use this then using for-loops.

• anter69commented on "Calculate BMI" python solution

Right, I should have chosen a better name

• Locustcommented on "Calculate BMI" python solution

Even though this is clearly not a recursive function, reusing the name bmi does not seem like best practices to me.

• FArekkusucommented on "Highest Rank Number in an Array" python solution

It's `O(n^2)`, not `O(n^2 * log(n))`. Python caches the sorting criteria, so the code translates into: `sorted(LINEAR_FUNCTION(x) for x in arr)`.