DSA Crash Course [Part 16] - Intersection Approach

In this lesson, Alvin explores the strategy to solving the following interview problem:

Write a function, intersection, that takes in two lists, a,_b_, as arguments. The function should return a new list containing elements that are in both of the two lists.

You may assume that each input list does not contain duplicate elements.

intersection([4,2,1,6], [3,6,9,2,10]) # -> [2,6]

intersection([2,4,6], [4,2]) # -> [2,4]

intersection([4,2,1], [1,2,4,6]) # -> [1,2,4]

If you need additional support taking these DSA skills and actually applying them, take Alvin's complete data structures and algorithms course on Structy. You can try out the concepts yourself in their interactive code editor and learn advanced DSA patterns like stack exhaustive recursion.

Use this link to get 20% off the entire Structy DSA learning experience.

Follow Alvin on LinkedIn: https://www.linkedin.com/in/alvin-zablan-b73a92117/