8 pts
Hashing cost model precision
Which statement is the strongest professional description of hash-map lookup cost?
This assessment verifies the Hashing module. Passing it contributes up to 7 points in the 23-29 score band.
Questions
8
Limit
80m
Pass
85%
Score
+7
8 pts
Which statement is the strongest professional description of hash-map lookup cost?
14 pts
Given orders with userId and users with id/name, return order views with buyerName without scanning the full users list for every order. Include complexity, missing-user behavior, and duplicate-user-ID policy.
14 pts
A payment provider may deliver the same webhook multiple times. Processing a duplicate can send duplicate emails and issue duplicate credits. Design the deduplication strategy and state where an in-memory set is insufficient.
12 pts
Review this fraud feature proposal: `suspiciousIps.add(ip)` records IPs with failed logins. Product later asks which IPs have more than 50 failures in 10 minutes. Explain the flaw and propose the right structure.
14 pts
Given two strings, determine whether they are anagrams after lowercasing and keeping only letters a-z. Explain why normalization must happen before counting and give complexity.
12 pts
Review a cache that stores account settings by `userId`. The product is multi-tenant, and users from different tenants can share the same user ID format. What is the bug, how do you fix it, and why is this not a collision problem?
14 pts
A streaming ingestion service wants duplicate suppression for recent event IDs, but unique event IDs can reach hundreds of millions per day. Design a bounded approach and state the trade-off.
12 pts
Which structure selection answer is strongest?