Intersection of two sorted arrays

Medium

You're given 2 sorted arrays. Write a function that returns the intersection of the arrays.

For example, given the following sorted arrays

A = [1, 4, 6, 7, 9]
B = [2, 4, 5, 6]

Your function should return numbers that exist in both arrays:

[4, 6]

Try it first

def intersection(A: list[int], B: list[int]) -> list[int]:
    # implement intersection
    return []

1def intersection(A: list[int], B: list[int]) -> list[int]:
2    # implement intersection
3    return []
4

Master Sorting & Searching by trying the coding challenges below.

Stack Bash helps new and veteran software engineers master data structures and algorithms for technical interviews.