Apple Interview Question
Software Engineer / DevelopersCountry: United States
Actually it should be O(N)
consider the worst hashing function, where all objects are in single basket.
To find the last element in the basket (let assume linked list traversal) it would take N compares.
O(1) expected time.
- eugene.yarovoi April 10, 2012