K-th of Two Sorted Arrays — Solution & Editorial

Back to the Problem

Merge with two pointers, stopping after K steps — no need to materialize the merged array. (Binary search does it in O(log) if you want the challenge.)

Complexity: O(K)