Given n integers in the range 0 to k, answers any query about how many of the n integers fall into a range [a b] in O(1) time. Make your own assumptions and build your own indexing data structures.
PS: I was used to ask this question during my interviews. Now no longer ;-)
What Do I Have to Do to Get You to Watch Veep? - *Veep *is an HBO comedy of political ill-manners, currently in its second season. It was created by mastermind architect of vicious profanity, Armando Ia...
15 minutes ago