Is this helpful ?
easy - accepted / - tried
Given 2 sorted array of integers, find the elements that exist in both arrays.
intersect( [1,2,2,3,4,4], [2,2,4,5,5,6,2000] ) // [2,2,4]
- The arrays might have duplicate numbers.
- The order of returning result doesn't matter.
- What is the time & space cost of your approach? Could you improve it?
Let's try to solve this problem within 10 minutes.