Merge Two Sequences Preserving Each Order

Asked at Google · Coding Questions · Difficulty: Medium · Last asked Nov 11, 2026

Two lists of integers each describe the order in which some items must appear. Decide whether the two lists can be combined into one single list that contains every value exactly once and keeps the relative order of each original list. A value that appears in both lists is the same item, and it acts as an anchor that ties the two orders together.

Loading the problem…