Problem 2540 · Easy

Minimum Common Value

Walk two sorted lists with one pointer each, always advancing the pointer at the smaller value, so the first equal pair is the smallest common value.

Open the interactive visualisation