Problem · Array
Merge K Sorted Arrays Without Duplicates
● Medium
AmazonFULLTIMEPHONE SCREEN
See Amazon hiring insightsAmazonFULLTIMEPHONE SCREENProblem statement
Given k integer arrays in arrays, where every array is sorted in nondecreasing order, merge them into one sorted array.
The problem statement continues
ProExamples
Example 1
arrays = [[1,2,2,7],[2,3,7],[1,5,8]]return = [1,2,3,5,7,8]The merge preserves sorted order while emitting shared values such as 1, 2, and 7 only once.
FastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 1 more worked example, explained
- Guided hints and editorial
- Run your code on real test cases
$9/month
Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week