The instructions say that it is guaranteed that either everyone has the same amount of money or only one has the maximum value

Why Phil isn't also the winner ?
Check the instructions.

@amigo9876, please edit your comment to format your code properly. By the way, it doesn't seem wrong to me. A lot of people chose this approach, including the current "best practice" solution.

Really the worst kata :(

If array is [1.0, 1.0, 1.2, 1.3, 0.8, 0.9, 1.0] There will be a lot of wrong solutions.

Thanks a lot, now i understand :)

It looks like this is a time series of price values of some item: you read the prices left to right, and for each price value you must decide to buy or sell or pass. You cannot go back in time. In your example, if you bought at 0.8, you would only be able to sell at 0.9 or 1.0, because selling at 1.2 would require you to go back in time.

What's wrong with author's example? He claims, ideal traider got profit +50%. But it's not right.

1. I have $100, and can buy 120 stocks by 0.8.
2. I sell 120 stock by 1.2 = $150
3. I buy 166.66 stocks by 0.9
4. Sell it buy 1.0.
   So a got profit from 100 to $166.6. It's +66%, not +50%

I've never thought that 'Y' is not a vowel!!!!

Don't understand why this solutuin so liked and "clevered".It's doesn't work, because if min(total) == max(total) and len(students) > 1: - wrong condition.
cameron = 30, Phil = 30, Geoff = 15.
Cameron is winner, but right answer - all.

Too easy

Give please some clue, how to help barista:)
I haven't any idea...

Dunno what to tell you, I control self.level creation and incrementation.

There's no way for it to not be an integer.