You're given an infinite array, Implement setAll and get functions in time complexity of O(1).
Anonymous
You're given a list of pairs [,...] merge overlapping pairs for example [<1,3>,<2,6>,...> would return [<1,6>,...].
Check out your Company Bowl for anonymous work chats.