First clear solution for The Final Stone by Tinus_Trotyl - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

First solution in Clear category for The Final Stone by Tinus_Trotyl

def final_stone(stones: list[int]) -> int:
    while len(stones) > 1: stones = (sst := sorted(stones))[:-2] + [sst[~0] - sst[~1]]
    return stones[0] if stones else 0

July 21, 2022

Comments:

Selindian on Sept. 11, 2022, 7:40 p.m.
<p>Wow, that's a clever and short solution. I really like it. Especially the `(sst := sorted(stones))[:-2] + [sst[~0] - sst[~1]]` part. :-)</p> <p>Thank you for sharing it with us.</p>

The Game is Worth it!

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.