Parity-Swapping Integer Minimization

Problem Description

Given a non-negative integer consisting of n digits, you can perform any number of swaps between adjacent digits if the swapped digits have different parities. Find the minimum integer you can obtain after completing any number of swaps.

Problem Constraints

1 ≤ n ≤ 3 × 10⁵

Input Format

The first argument is a number.

Output Format

Return the minimum integer you can obtain after performing any number of swaps.

Example Input

Input 1:

Input 2:

Example Output

Output 1:

Output 2:

Example Explanation

For Input 1:

You can perform the following sequence of operations: 0709 → 0079.

For Input 2:

You can perform the following sequence of operations: 246432 → 246342 → 243642 → 234642

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.

Start solving Parity-Swapping Integer Minimization on Interview Code Editor

Hints

Hint 1
Solution Approach
Complete Solution

Parity-Swapping Integer Minimization

Discussion