How will you implement sets and the intersection operation? Complexity?
Anonymous
I suggested to implement sets using self-balanced binary trees, although I can be done (dunno if in a more efficient way) with hashmaps.
Check out your Company Bowl for anonymous work chats.