O(|m-n|) time and O(1) space speedy solution for Stones Placing by StefanPochmann - python coding challenges

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

O(|m-n|) time and O(1) space solution in Speedy category for Stones Placing by StefanPochmann

def stones_placing(*a):
    c, r = sorted(a, key=len)
    for i in range(len(c) - 1, len(r)):
        if r[-i] == r[~i]:
            return r[-i]
    return c[1]

June 25, 2025

Comments:

veky on July 14, 2025, 5:26 p.m.
<p>Nice comparison. :D</p>

StefanPochmann on July 15, 2025, 5:09 p.m.
<p>Heh, I suspected you might like that :-). I found it amusing, although it's certainly slower than your <pre class='brush: python'>i</pre> and <pre class='brush: python'>i - 1</pre>.</p>

Rock

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.