# Maximum Expression Codechef Solution

### We Are Discuss About CODECHEF SOLUTION

Maximum Expression Codechef Solution

## Problem

You are given a string S of length N, consisting of the digits 0-9 and the characters '+' and '-'S represents a valid mathematical expression.

Rearrange the characters of S to form a valid mathematical expression such that the result obtained upon evaluating it is maximum.

If there are multiple possible answers, you may print any of them.

Note: A string S of length N is said to be a valid mathematical expression if the following hold:

• The first character of S is not + or -.
• The last character of S is not + or -.
• Any + or - in S must not be adjacent to another + or -.

In particular, numbers are allowed to have leading zeros, and adding/subtracting zero is fine.

### Input Format

• The first line of input will contain a single integer T, denoting the number of test cases.
• Each test case consists of 2 lines of input.
• The first line of each test case contains a single integer N, denoting the size of the string.
• The second line of each test case contains the string S.

### Output Format

For each test case, output on a new line the rearranged string giving the maximum value upon evaluation. If there are multiple possible answers, you may print any of them.

### Constraints

• 1 \leq T \leq 1000
• 3 \leq N \leq 10^5
• Each character of S is one of \{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, +, -\}.
• The sum of N across all test cases won’t exceed 1.5 \times 10^6.

## Maximum Expression Codechef Solution

Yhaa You have done it but next? if YOU Want to Get Others Please Visit Here JOIN NOW