Reviewed, Forked & Approved. (Honor points goes to you)

Beutiful.

yes and no

It is time to learn boolean :)

🔪

Today i learned: You can do this

im asking why people vote it as cleaver ?

I dont C/P. I am printed, dude...

This is what you have to figure out by yourself. The description gives all the elements to find the result. Minimum height posible just means what it says: if you find some combination but there exists another possibility that satisfies all the other requirements with 1st being lower, then your solution is incorrect. It's not as obvious as one could think at first sight, but I think any hint would definitively spoil the solution. If you cannot find it out, a good option can be to move on to other katas. Someday maybe the answer will pop into your mind with clarity.

I don't understand how to calculate the output.
I know what to return, and the order within the array, but not how to divide it.
What do they mean by "minimum height possible"?
Looking at the examples, the winner (middle) place is sometimes half, but sometimes not.

Help??? :)

see comments in the fork

Could you explain a little bit what you did here? :p

Awesome, although you didn't even need ''.join()

Just what I was thinking.

This seems to be wrong since it looks only if ? is in string, but not if it is the last character