Yelp Interview Question
What is the best and worst case time complexities for a hash table?
Interview Answer
Anonymous
Nov 17, 2011
Best case is O(1), worst case is O(n)
1
What is the best and worst case time complexities for a hash table?
Anonymous
Best case is O(1), worst case is O(n)
Check out your Company Bowl for anonymous work chats.