## Similar Problems

Similar Problems not available

# How to find intersection of two arrays ? - Leetcode Solution

LeetCode: How to find intersection of two arrays ? Leetcode Solution

Difficulty: Easy

Topics: sorting

## How to find intersection of two arrays ?

Given two arrays, write a function to compute the intersection of the two arrays

#### Example 1:

Input: nums1 = [2,3,4,5], nums2 = [4,6,7,5]

Output: [4,5] Explanation: This is because the intersection (common elements ) of these two arrays are [4, 5]

#### Example 2:

Input: nums1 = [1,3,5] nums2 = [4,5]

Output: [5] Explanation: This is because the intersection (common elements) of these two arrays are [5]

#### Note:

- Each element in the final intersection should appear as many times as it shows in both arrays.
- The result can be in any order.

### Solution:

To find the intersection of two arrays, we can use simple sorting approach as follows:

- Sort both the arrays.
- Take three variables i, j, k. Initialize them with
`0`

. - From
`nums1[i]`

and`nums2[j]`

check whether:`nums1[i]`

<`nums2[j]`

, increment i as ++i.`nums1[i]`

>`nums2[j]`

, increment j as ++j.`nums1[i]`

==`nums2[j]`

, add the value to the resulting array and increment both i and j as well as k.

- Return the resulting array which contains the final intersection.

Here to reduce the space complexity, we just add our resulting values to the `nums1`

array instead of creating a new array.

### Complexity Analysis:

**Time Complexity:**O(nlogn + nlogm), n and m are length of given two arrays.**Space Complexity:**O(1).

## How to find intersection of two arrays ? Solution Code

`1`