Good morning! Here's our prompt for today.

As we ease our way into the course, we'll want to start with the basic data structures and their operations. However, don't be fooled how fundamental these things are!

Interviewers will often test you on things that are deceptively easy. We saw this in Reverse a String, and will see more in future challenges. But sometimes you might get tested on a concept that, while a bit trivial, is really useful in day to day software engineering.

One of those things is array manipulation, or basically doing things to an array that creates some kind of transformation.

Prompt

Can you write a function that takes two arrays as inputs and returns to us their intersection? We can call the method intersection. Let's return the intersection of the two inputs in the form of an array. As a reminder, the definition of an intersection of two sets A and B is the set containing all elements of A that also belong to B (or equivalently, all elements of B that also belong to A).

Note that all elements in the final result should be unique. Here's one example:

1const nums1 = [1, 2, 2, 1];
2const nums2 = [2, 2];
3
4intersection(nums1, nums2);
5// [2]

And here's another one:

1const nums1 = [4,9,5];
2const nums2 = [9,4,9,8,4];
3
4intersection(nums1, nums2);
5// [9, 4]

Constraints

• Length of the array <= 100000
• The values in the array will be in the range -1000000000 and 1000000000
• Expected time complexity: O(n+m) where n and m are the lengths of the array.
• Expected space complexity: O(max(n,m)).

Try to solve this here or in Interactive Mode.

How do I practice this challenge?

xxxxxxxxxx

    'PASSED: `intersection([4,17,4,4,15,16,17,6,7],[15,2,6,20,17,17,8,4,5])` should return `[15,6,17,4]`'

var assert = require('assert');

​

function intersection(nums1, nums2) {

  // fill this in

  return [];

}

​

try {

  assert.deepEqual(intersection([6, 0, 12, 10, 16], [3, 15, 18, 20, 15]), []);

​

  console.log(

    'PASSED: `intersection([6,0,12,10,16],[3,15,18,20,15])` should return `[]`'

  );

} catch (err) {

  console.log(err);

}

​

try {

  assert.deepEqual(intersection([1, 5, 2, 12, 6], [13, 10, 9, 5, 8]), [5]);

​

  console.log(

    'PASSED: `intersection([1,5,2,12,6],[13,10,9,5,8])` should return `[5]`'

  );

} catch (err) {

  console.log(err);

}

​

try {

  assertSameMembers(

Tired of reading? Watch this video explanation!

To change the speed of the video or see it in full screen, click the icons to the right of the progress bar.

Here's how we would solve this problem...

How do I use this guide?

Brute Force

We'll start off slowly, by using the smallest sample inputs possible to examine the make-up of the problem. We know we'll need a result array to return, so hold that in mind:

1const results = [];

Let's say we need to find the intersection of two arrays: [1] and [1]. In this case, we know that the output is also [1]-- it's rather simple, because we just need to do a straight comparison of 1 and 1. We go through the first [1], see the 1, and locate it in the second array. Because they're the same, we just return a result with that match.

So we need to expand beyond this. Let's say the two inputs are modified to [1] and [2]. Well, when we compare the two single elements, we know that they're not the same. We thus don't need to do anything with result.

As this continues beyond one array element, we can continue this process of checking if each element in the first array exists in the second.

So, we can loop through the first array, and at each iteration, check whether that element exists in the second array. We can check the existence of elements in the second array using nums2.indexOf(num) !== -1. But after this, we need to make sure that the returning array has unique elements. We can easily do this by hashing technique. A hash Object will suffice to ensure uniqueness. This works because object keys must be unique.

1const first = [4, 9, 5];
2const second = [9, 4, 9, 8, 4];
3
4function intersection(nums1, nums2) {
5	let intersection = {};
6
7	for (const num of nums1) if (nums2.indexOf(num) !== -1) intersection[num] = 1;
8
9	return Object.keys(intersection).map((val) => parseInt(val));
10}

A much simpler way of doing the same thing using the includes method is given below.

But the problem with this implementation is its inefficiency. For example, in the below js implementation, it takes O(n*m) where n and m are the lengths of the arrays. It first runs a loop using firstArray.filter method, and then at each iteration, it calls secondArray.includes(el) which is linear in time.

xxxxxxxxxx

const firstArray = [4, 9, 5];

const secondArray = [9, 4, 9, 8, 4];

​

let intersection = firstArray.filter((el) => {

  return secondArray.includes(el);

});

The concept of intersection is from set theory, so this problem is really simple if we just use Sets! In mathematics, the intersection of two sets A and B is the set that contains all elements of A that also belong to B.

Sets are an object type in most languages that allow you to store unique values of most primitives. The strength of set is that implementation of unordered set in most programming languages only takes O(1) worst time complexity for checking the existence of an element. So, we can replace the secondArray.includes(el) part of previous js code with a set operation!

If we transform our input arrays into sets, we can make use of the filter method, and apply it to one of the sets-- filtering out anything not in the other set.

xxxxxxxxxx

const first = [4, 9, 5];

const second = [9, 4, 9, 8, 4];

​

function intersection(nums1, nums2) {

  const set = new Set(nums1);

  const filteredSet = new Set(nums2.filter((n) => set.has(n)));

  return [ ...filteredSet ];

}

The creation of a set from an array of n elements takes O(n) time complexity. Let us think that the first array is of length n and the second array is of length m.

Then the final time complexity of the above implementation would be O(m+n). Let us explain this step-by-step:

1. We create a set from the first array: O(n).
2. We traverse through the second array with filter method which takes O(m). In this traversal process, we check if that element exists in the set from the first array which takes O(1).
3. Finally we create the resulting array from the filtered second array which takes O(m) worst time. Remember, although we may return an array, it is crucial to building a set first. The reason is to remove duplicates from the filter of the second array.

So, the final time complexity is O(n + m + m) = O(m+n).

This problem will help you to get experience on where to use the set even if it is not mentioned in the problem statement. It might be helpful to use the Set if you encounter a similar problem during your interview. This is because it demonstrates knowledge of a commonly used data structure and a background in mathematics.