{"id":"unlimited-swaps-equals-independent-sort","text":"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","truth_value":"IN","source":"entries/2026/06/06/largest-number-after-digit-swaps-by-parity-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"unlimited-swaps-equals-independent-sort","truth_value":"IN","reason":"premise"}]}}