Home Roadmap Courses Problems Dashboard Pricing

Home Roadmap Courses Problems Dashboard Pricing

Loading editor…

Problem 69

Relative Sort Array

EasySorting

Sort arr1 so values that appear in arr2 come first, in arr2's order (with duplicates). Remaining values come last, sorted ascending.

Examples

Example 1

Input: arr1 = [2,3,1,3,2,4,6,7,9,2,19], arr2 = [2,1,4,3,9,6]

Output: [2,2,2,1,4,3,3,9,6,7,19]

Constraints

arr2's values are distinctAll arr2 values appear in arr1

Target ComplexityNot required

O(n log n) Time · O(n) Space

Companies (2)

GoogleAmazon

Node 22.08.0

Loading editor…

Test casesRun to compare output

Inputarr1 = [2,3,1,3,2,4,6,7,9,2,19], arr2 = [2,1,4,3,9,6]

Expected[2,2,2,1,4,3,3,9,6,7,19]

Output—