You are given a string n representing a large integer and a single integer digit x.

Insert the digit x at any position in n so that the numerical value of the resulting number is maximized. You cannot alter the relative order of the existing digits in n.

Return a string representing the maximum possible value after inserting x.

Constraints:

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

• $1 \leq$ x $\leq 9$

• The digits in n are in the range $[1, 9]$.

• n is a valid representation of an integer.

• In the case of a negative n, it will begin with '-'.

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.