Login and get coding
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!
Will you be Pythonista #235 to crack this Bite?
Resolution time: ~41 min. (avg. submissions of 5-240 min.)
Pythonistas rate this Bite 2.82 on a 1-10 difficulty scale.
» You can do it! 😌