Status: IN
For problems where unlimited swaps are allowed within a partition (e.g., same-parity digits), the optimal strategy reduces to sorting each partition group independently in descending order — this pattern appears in `largest-number-after-digit-swaps-by-parity` and likely recurs across similar problems
Source: entries/2026/06/06/largest-number-after-digit-swaps-by-parity-solution.md