Relative Sort Array Python Solution with Tests

lcpy gen -n 1122   # by problem number
lcpy gen -s relative_sort_array   # by problem name

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]

Input: arr1 = [28,6,22,8,44,17], arr2 = [22,28,8,6]
Output: [22,28,8,6,17,44]

class Solution:
    # Time: O(n log n)
    # Space: O(n)
    def relative_sort_array(self, arr1: list[int], arr2: list[int]) -> list[int]:
        rank = {v: i for i, v in enumerate(arr2)}
        present = sorted((x for x in arr1 if x in rank), key=lambda x: rank[x])
        rest = sorted(x for x in arr1 if x not in rank)
        return present + rest