Tap here to switch tabs
Problem
Submissions

Problem: Largest Number After Digit Swaps by Parity

Largest Number After Digit Swaps by Parity gives you a positive integer. Return the greatest value possible after swapping digits only with others that have the same 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≤1 \leq num ≤109\leq 10^9

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Largest Number After Digit Swaps by Parity

Largest Number After Digit Swaps by Parity gives you a positive integer. Return the greatest value possible after swapping digits only with others that have the same 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≤1 \leq num ≤109\leq 10^9