Search
⌘K
Leetcode 349. Intersection of Two Arrays
Return the distinct integers that appear in both input arrays (order does not matter). The core challenge is deduplicating and computing the set/hash-based intersection of the two arrays (each length ≤ 1000).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.