InterviewDB
Experience
Hashmap Difference: Compute the Symmetric Difference Between Two Hashmaps
phone
Interview Experience
Problem Given two hashmaps (dicts) A and B, compute their difference report: keys only in A, keys only in B, keys in both but with different values, and keys in both with identical values. Example: Follow-ups How do you handle nested dicts — would you diff recursively? What equality check do you use for values that may be lists or objects? How would you serialize the DiffReport as a human-readable patch format? How would you apply a DiffReport to transform dict A into dict B?
Full Details
🔒
Unlock all Nextdoor questions
Full insider details, leaked discussions, and candidate experiences.
Get full access — $100 a year, unlimited accessAbout This Question
This is a candidate experience report from a nextdoor interview during the phone round.
It covers the following topics: Coding, Phone, Hash Table .
Topics
More Nextdoor Interview Questions
1p3a
nextdoor software engineer tech phone screen interview overview
LeetCode
#56 Merge Intervals
InterviewDB
Comment Tree: Build and Traverse a Nested Comment Thread Like Reddit's
InterviewDB
Nextdoor SWE Onsite - Letter Combinations
1p3a
Nextdoor Full-Time SDE Tech Phone Screen Interview Questions