That’s an interesting question, will heapq make it more efficient?
Tomáš Bouda
1

You don’t need the `key` function. Comparison on tuple will be enough.

(1, 2) < (2,3)

In addition to that `remove` (from a list) might be native but still linear in implementation. Popping off heap is logn.

You can push the entire tuple into the heap, and as long the frequency is the first item, it should work fine.

https://gist.github.com/st0le/a4efe0295b83e2bcae5f005195362561

One clap, two clap, three clap, forty?

By clapping more or less, you can signal to us which stories really stand out.