{"id":"sort-then-scan-pattern","text":"The sort-then-scan pattern (sort to establish adjacency invariants, then linear scan) recurs across multiple solutions in the repo including `minimum-absolute-difference`, `array-partition`, and `largest-perimeter-triangle`.","truth_value":"IN","source":"entries/2026/06/06/minimum-absolute-difference-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"sort-then-scan-pattern","truth_value":"IN","reason":"premise"}]}}