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!

Will you be Pythonista #51 to crack this Bite?
It takes an average of ~51 minutes to solve this Bite (submissions 5-240 min).
Pythonistas rate this Bite 3.25 on a 1-10 difficulty scale.
» You can do it! 😌

Login and get coding
We use Python 3.7