I keep getting "you returned indices that are larger than the array length." Someone verify this works in c? The count should represent the array length right?

Many of the random tests in c have leading spaces.

Use something like bubble sort but make it sort not-zeros and zeros.

A temporary array/object is a place for you to store values and then stitch them together again.

I assume the kata wants you to implement a sorting algorithm... unless it thinks comparisons should also count as a temporary object, in which case, I am at a loss.

He also used a String which is an object.

This was the hardest Kata i've ever done. Harder than some 2kyus easily.

Much appreciated. 👍

Your post was visible in the homepage discourse. I've already added the flag.

I would have added the spoiler flag if this was the open-discourse; but this is a question about my implementation. Anyone that wants to sift through the other solutions can already see all of the other implementations -- some of which are what I derived here.

That said and considered, should we go back and add the spoiler tag?

Please use spoiler flag next time.

What is the logic here? You lost me at the biquadratic root of 4m

Great minds think alike XD

no need to convert to int after using math.floor() :)

https://www.codewars.com/kata/5a70285ab17101627a000024