Find Intersection of Sorted Arrays
Two Pointers: Compare elements at i and j
• If A[i] == B[j]: Found match! Add to result, advance both
• If A[i] < B[j]: Advance i (A[i] can't match anything)
• If A[i] > B[j]: Advance j
Time: O(n + m)
O(n + m)