Practice IBM Coding Question | Real Coding Interviews

Quick Summary

Swap only adjacent digits sharing the same parity.
Rearrange digits to form the lexicographically largest possible string.
Digits of differing parity create fixed boundaries between independently sortable segments.

What This Tests

String manipulation and boundary detection
Greedy optimization strategies
Local sorting within constrained partitions
Time complexity analysis for linear scans

Common Patterns

Greedy

Sorting

Two Pointers

(This question is a variation of the LeetCode question 2231. Largest Number After Digit Swaps by Parity. If you haven't completed that question yet, it is recommended to solve it first.)

You are given a numeric string num. You may swap two adjacent digits only when they have the same parity, meaning both digits are odd or both are even. You may perform this operation any number of times.

Test Cases

Input

Output

Expected