Second speedy solution for Escher Symmetry by juestr - python coding challenges

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

Second solution in Speedy category for Escher Symmetry by juestr

from itertools import islice

def is_figure(data: list[int]) -> bool:
    sums = (x + y for x, y in zip(data, reversed(data)))
    h = next(sums, 0)
    return all(s == h for s in islice(sums, len(data) // 2))

May 31, 2024

Comments:

amandel on Oct. 21, 2024, 9:39 p.m.
This is the opposite of speedy. Several "clear" solutions are simpler and likely faster than this.

juestr on Oct. 22, 2024, 1:45 p.m.
It should be an incremental speed improvement over my First. Not sure why you think this is the opposite of speedy, it avoids creating a <pre class='brush: python'>set</pre> like the top clear solutions, unnecessary list allocations, and restricts work to the relevant half. It may be slower than the pure index-based solutions which I not even think of any more, but I don't think there's much else you can do here (without numpy).

amandel on Oct. 22, 2024, 1:53 p.m.
I apologize. I failed to see that your solution is totally iterator based.

Strings Theory

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.