First clear solution for Shorter Set by juestr - python coding challenges

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

First solution in Clear category for Shorter Set by juestr

def remove_min_max(data: set, total: int) -> set:
    return set(sorted(data)[total:len(data)-total])

Nov. 9, 2021

Comments:

Selindian on Dec. 12, 2022, 1:42 p.m.
Nice. It makes totally sense to sort the elements and slice the min/max away. :-) Thanks for sharing.

juestr on Dec. 12, 2022, 2:57 p.m.
Thanks. I'd like to point out that sorting is simple but more work than needed, at least for large sets (much larger than here). An asymptotically better performing but much more complex solution is shown <a href="https://py.checkio.org/mission/shorter-set/publications/juestr/python-3/on-on-average-using-quickselects-side-effects/">in speedy</a>.

Different kind of sets

0 %

PyCharm The Python IDE for Professional Developers. Enjoy productive Python, web and scientific development with PyCharm. Download it now!