Skip to content

Instantly share code, notes, and snippets.

@vicxruiz
Last active March 18, 2020 15:03
Show Gist options
  • Save vicxruiz/ffc1f102979a3903237e7f35646962c7 to your computer and use it in GitHub Desktop.
Save vicxruiz/ffc1f102979a3903237e7f35646962c7 to your computer and use it in GitHub Desktop.
Given two arrays arr1 and arr2, the elements of arr2 are distinct, and all elements in arr2 are also in arr1.
Sort the elements of arr1 such that the relative ordering of items in arr1 are the same as in arr2.
Elements that don't appear in arr2 should be placed at the end of arr1 in ascending order.
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]
func relativeSortArray(_ arr1: [Int], _ arr2: [Int]) -> [Int] {
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment