Hash Table Operations

Easy

computer-science Meta Microsoft

What is the average-case time complexity for lookup in a hash table, and what can degrade it?

Multiple Choice

O(log n) average; degraded by unbalanced trees O(1) average; degraded by hash collisions that cause many keys to map to the same bucket O(n) average; improved by adding more hash functions O(1) always; nothing can degrade performance

Correct!

Incorrect — try again next time!

Upgrade to Pro to unlock solutions and explanations

Hash Table Operations

Multiple Choice

Related problems

Deep-dive guides