You are given a string num representing a large integer and an integer array change of length $10$.

You may mutate at most one contiguous substring of num. To mutate a substring, replace each individual digit d in the chosen substring with the corresponding digit change[d].

Return a string representing the largest number that can be formed after applying this operation.

Note: A substring is a contiguous sequence of characters within a string.

Constraints:

• $1 \leq$ num.length $\leq 10^5$

• num consists of only digits from $0$ to $9$

• change.length $= 10$

• $0 \leq$ change[d] $\leq 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.