26 out of 26 users completed this Bite ...
Will you be Pythonista #27 to crack this Bite?
Average Bite difficulty 1-10 rating: 2.5
» You can do it! 😌
In this Bite you are provided with 3 data structures: a list of
ints, a list of
datetimes, and a list of
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!