Having fun with heapq
Level: Intermediate (score: 3)
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!