← Goldman Sachs questions

Merge multiple sorted lists containing duplicate elements

Filed under Goldman Sachs

Given $n$ sorted lists of integers that may contain duplicate elements, return all elements combined in sorted order efficiently.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Goldman Sachs questions

Collected from public candidate posts and coding forums. Updated Nov 2026.