Mid/SeniorGreedyString

Maximum Value after Insertion

You are given a very large integer n, represented as a string, and an integer digit x. The digits in n and the digit x are in the inclusive range [1, 9], and n may represent a negative number.

You want to maximize n's numerical value by inserting x anywhere in the decimal representation of n. You cannot insert x to the left of the negative sign.

Return a string representing the maximum value of n after the insertion.

Example 1
Inputn = "99", x = 9
Output"999"
The result is the same regardless of where you insert 9.
Example 2
Inputn = "-13", x = 2
Output"-123"
You can make n one of {-213, -123, -132}, and the largest of those three is -123.

Constraints

  • 1 <= n.length <= 10^5
  • 1 <= x <= 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 '-'.

Asked at 1 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate