Quiz · 4 questions
#️⃣ Hashing
The closest thing to magic: instant lookup
Level 0Curious Beginner
0 XP0/85 lessons0/19 achievements
0/100 XP to next level100 XP to go0% complete
Quiz
01How does a hash map find a key in O(1) average, without searching?
02Two different keys hash to the same slot. This is called a...
03Why is hash-map lookup O(1) 'average' but O(n) worst case?
04Which can be a dictionary KEY in Python?
Hint
A key's hash must never change after it's stored. What property of an object guarantees that?
Comments 0
🔔 Reply notifications (sign in)Sign in — Please sign in to comment.
No comments yet — be the first.