Solution: Largest Number After Digit Swaps by Parity

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 \leq$ num $\leq 10^9$

Solution

The algorithm rearranges the digits of a given integer ...