How will you store values such that the top n max element can be retrieved in O(1) time. (heaps) Given a large number of files and their generations at periodic intervals based on months, how will you store the information of their generation such that for any given month, you can retrieve the files generated in that month or months, also assuming that the order in which they are generated are always constant. (by mapping them to boolean values and performing AND and OR and NOT)
