what is the best data structure to solve the following problem? a list needs to be built dynamically. data must be easy to find, preferably in o(1). the user does not care about any order statistics such as finding max or min or median.
Please let us know your comments regarding the correct answer to the question. Each of your comments will be evaluated by us and correct comments will be shared.