Zalando interview question
Do you know get function complexity of HashMap?
Interview Answer
Anonymous
17 Aug 2017
In the worst case, a HashMap has an O(n) lookup due to walking through all entries in the same hash bucket. Interviewer disagreed. We agreed to disagree.
2