Problem 1213 · Easy

Intersection of Three Sorted Arrays

Return the values that appear in all three strictly increasing arrays. The visual advances three pointers and moves whichever one points at the smallest value.

Open the interactive visualisation