Problem
Ask
Submissions
Problem: Largest Number After Digit Swaps by Parity
Easy
15 min
Explore how to maximize a number by swapping its digits only when they share the same parity, either both odd or both even. This lesson teaches you to apply parity checks and digit rearrangement efficiently, helping you master problem-solving with heaps and parity constraints.
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:
num
Examples
Understand the problem
Figure it out!
Try it yourself
⋮
Problem
Ask
Submissions
Problem: Largest Number After Digit Swaps by Parity
Easy
15 min
Explore how to maximize a number by swapping its digits only when they share the same parity, either both odd or both even. This lesson teaches you to apply parity checks and digit rearrangement efficiently, helping you master problem-solving with heaps and parity constraints.
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:
num