avatar Bite 35. Having fun with heapq

In this Bite you are provided with 3 data structures: a list of ints, a list of datetimes, and a list of dicts.

Complete the 3 functions to return the largest n of each using heapq (our tests require this data type here).

Have fun and keep calm and code in Python!

Login and get coding
go back Intermediate level
Bitecoin 3X

Will you be Pythonista #204 to crack this Bite?
Resolution time: ~42 min. (avg. submissions of 5-240 min.)
Pythonistas rate this Bite 3.0 on a 1-10 difficulty scale.
» You can do it! 😌

We use Python 3.8