Given two Unsorted arrays that represent two sets (elements in every array are distinct), find the union and intersection of two arrays. For example, if the input arrays are: ...

// write a function to compute their intersection. // Runtime: 3 ms, faster than 40.92% of Java online submissions for Intersection of Two Arrays. // Memory Usage: 41 MB, less than 6.35% of Java ...