You are given a $0$ indexed integer array mapping of length $10$ that defines a mapping rule for digits from $0$ to $9$, where mapping[i] = j means that the digit $i$ is replaced by the digit $j$.

The mapped value of an integer is formed by replacing each of its digits with its mapped equivalent according to mapping. Leading zeros in the resulting mapped integer are ignored when evaluating its numerical value, though a mapped value of zero is treated as $0$.

You are also given an integer array nums. Sort the array nums in non decreasing order according to the mapped values of its elements and return the sorted array.

Note: If two elements have the same mapped value, they must preserve their original relative order from nums.

Constraints:

• mapping.length $= 10$

• $0 \leq$ mapping[i] $\leq 9$

• All the values of mapping[i] are unique.

• $1 \leq$ nums.length $\leq 3 imes 10^4$

• $0 \leq$ nums[i] $< 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.