@Ting-Hui, I don't know C#, but I do know C/C++. From that perspective I see 2 problems. It doesn't look like your properly converting the digit from a character to an integer. Try doing something like this, sumEveryCacula += (nToString[i] - '0') * divisions[b]. Also you're skipping the left-most digit. Change the loop condition from i > 0 to i >= 0.

As usual, you have an infinite loop.

Really Amazing!

Well, just read here :)

Why Sqrt it?

Learned a lot. Thanks.

Frustrated. I couldn't find where the mistake is at all.

Not the best place to start. This cata is not easy. As for me - I always try to figure out myself. As for the tests - that's the point. Passing 1 test is easy. Passing all is hard and teaches you to think ahead solving every possible condition.

Easy way to get help on solving a kata is to join this on gitter and ask what every questions you have.

This is the first Kata challenge I've tried to solve, so I'm still getting used to the rules of engagement on codewars.

It appears you need to pass 100% of the test cases to move to another challenge. I'm so close to solving this challenge, my current solution has passed all but 2 of the test cases. I've spent a enough time on this where I want to get some help. What do people do people normally do when they're so close but can't get every test case passed?

Do people ever post their current solution and get feedback from the discussion channel?

I dont see where you check max to be even.

UPD. oh my mistake. didnt count for int.

If you were mutating the array, then the tests were generated improperly, Now the tests are corrected to be generated correctly