Considering a server that should ignore requests older than 1 second, create a structure to handle this behavior and give its complexity.
Suppose we have the option of selecting Tree, Link list and Hash Table now the question is on what basis we should select each one for our use.
probabilistic Data structure which can search a object out of 100 million objects in nano seconds. 0.01% false positives are acceptable with no false negatives.
