Counter.most_common() clear solution for Sort Array by Element Frequency by tokyoamado - python coding challenges

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

Counter.most_common() solution in Clear category for Sort Array by Element Frequency by tokyoamado

from collections import Counter
from itertools import repeat

def frequency_sort(items):
    return [x for y in (repeat(*x) for x in Counter(items).most_common()) for x in y]

Dec. 12, 2018

Comments:

DenysChy on Feb. 18, 2019, 10:50 a.m.
Creative solution!

tokyoamado on Feb. 19, 2019, 12:10 a.m.
Thank you. `collections` is very interesting :-)

DenysChy on Feb. 19, 2019, 10:42 a.m.
I completely agree!

mazeua on Feb. 23, 2019, 4:41 p.m.
Cool itertools.repeat(*x) !

Joe_Salmans on March 6, 2019, 11:38 p.m.
Nice, I am absolutely terrible at list comprehensions. It helps me to see solutions like this

PHANTOM0308 on May 2, 2019, 2:10 a.m.
Yeah man, Collections is always the first one coming into my mind when solving this type of question!!!

rherron on May 28, 2019, 12:44 a.m.
Creative use of the repeat function. I was looking for something like that when I was working on this. The use of two separate iterator variables named 'x' made this way more confusing for me to read. <pre class='brush: python'>[z for y in (repeat(*x) for x in Counter(l).most_common()) for z in y] </pre> Is a little better and maybe informative names for the iterator variables might help. Personally, I'm not a fan of nested for loops in list comprehension because of the decrease in readability (imo).

tokyoamado on May 28, 2019, 1:12 a.m.
Thank you for good comment. Taking about 'nested list comprehension', I found another way to flatten shallow lists using `chain.from_iterable`. <pre class='brush: python'>list(chain.from_iterable(repeat(*x) for x in Counter(items).most_common())) </pre> It seems smarter than my original code, isn't it?

rherron on May 28, 2019, 6:30 a.m.
Nice work! I tried for a bit to get it working in one line without list comprehension and failed. Then I played around with itertools.chain for the 'Flatten a List' problem, but never brought it all together like you. Definitely a fun use and exploration of the standard library. Thanks for giving me new ideas on how to combine these things!

assargin on Feb. 10, 2020, 4:18 p.m.
Haha, like mine, but as I can see there is no order processing for elements with equal frequency :)

tokyoamado on Feb. 14, 2020, 1:09 a.m.
Hmm... How about this? <pre class='brush: python'>order = {k: v for v, (k, _) in enumerate(Counter(items).most_common())} return sorted(items, key=order.__getitem__) </pre>

MuxaJlbl4 on Nov. 23, 2020, 1:38 p.m.
Nice!)

Oleg_Levonjuk on Feb. 3, 2021, 12:42 p.m.
Code with list comprehensions in many cases difficult to read, although concise. But in this case comprehension looks pretty clear. Nice work!

guzewen07 on June 3, 2021, 4:43 p.m.
Yeah man, Collections is always the first one coming into my mind when solving this type of question!!!

sadra84_99231026540944e4be05aa on June 15, 2021, 10:52 a.m.
it could be done without using itertools

Georgyphyton on Dec. 29, 2023, 12:11 p.m.
Creative solution! Nice idea to use Counter and repeat

List, list and list again

0 %

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