LeetCode Intersection of Two arrays Solution Explained - C++

The solution to LeetCode problem - Intersection of Two arrays. We create two sets for the two arrays. We iterate on the array and add the elements to the sets. Finally, we iterate on one set and check if the element is present in the other set or not. In case the element is found, then the element is added to the result vector.

Time Complexity - O(n)
Space Complexity - O(n)

You can follow me on:-

[akshatbajpai]

can you please explain 17th line of the code??