Yelp interview question
What is the average look-up time for a good hash-function
Interview Answers
Anonymous
18 May 2011
basically O(1) (constant) at best, and O(n) (linear) at worst
1
What is the average look-up time for a good hash-function
Anonymous
basically O(1) (constant) at best, and O(n) (linear) at worst
Check out your Company Bowl for anonymous work chats.