This is the sixth "Top interview question" in the Arrays section on leetcode.
We need to find the intersecting numbers in two arrays. I attempt this task in three different ways. Method one uses a nested loop, method two sorts the arrays and uses two pointers to walk through the arrays and method three uses a hashmap.