Largest Number After Digit Swaps by Parity

Try to solve the Largest Number After Digit Swaps by Parity problem.

We'll cover the following

Statement

You are given a positive integer num. You can swap any two digits of num as long as they share the same parity (both are odd or both are even).

Your task is to return the largest possible value of num after performing any number of such swaps.

Constraints:

  • 1≤1 \leq num ≤109\leq 10^9

Examples

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.