{"id":"dominant-pipeline-mutation-has-zero-observable-consequence","text":"The sort-then-two-pointer pipeline's primary side effect — in-place sort mutation of the input array — has zero observable consequence because the single-call LeetCode context ensures no caller ever inspects the mutated ordering, making the most prevalent form of input modification in the entire codebase functionally invisible.","truth_value":"IN","source":"","source_url":"","source_hash":"","justifications":[{"type":"SL","antecedents":["sort-then-two-pointer-dominant-pair-pipeline","mutation-invisible-in-single-call-context"],"outlist":[],"label":"The most common pipeline's most impactful side effect (sort mutation) is invisible in the single-call evaluation context"}],"dependents":[],"metadata":{"source_type":"derived","last_reviewed":"2026-06-07T22:02:22","review_result":"pass"},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"dominant-pipeline-mutation-has-zero-observable-consequence","truth_value":"IN","reason":"SL justification valid","antecedents":["sort-then-two-pointer-dominant-pair-pipeline","mutation-invisible-in-single-call-context"],"label":"The most common pipeline's most impactful side effect (sort mutation) is invisible in the single-call evaluation context"},{"node":"sort-then-two-pointer-dominant-pair-pipeline","truth_value":"IN","reason":"SL justification valid","antecedents":["sort-preprocessing-enables-linear-scan","two-pointer-primary-linear-array-technique"],"label":"sort provides the sorted precondition that two-pointer inward sweep and sorted-pair matching require; these two depth-1 patterns co-occur in two-sum-less-than-k, array-partition, and meeting-rooms families"},{"node":"sort-preprocessing-enables-linear-scan","truth_value":"IN","reason":"SL justification valid","antecedents":["sort-then-two-pointer-pattern","meeting-rooms-sort-then-scan","array-partition-sort-greedy","subsequence-limited-sum-greedy-sort"],"label":"Sorting is the universal complexity bridge from quadratic brute-force to n-log-n solutions"},{"node":"sort-then-two-pointer-pattern","truth_value":"IN","reason":"premise"},{"node":"meeting-rooms-sort-then-scan","truth_value":"IN","reason":"premise"},{"node":"array-partition-sort-greedy","truth_value":"IN","reason":"premise"},{"node":"subsequence-limited-sum-greedy-sort","truth_value":"IN","reason":"premise"},{"node":"two-pointer-primary-linear-array-technique","truth_value":"IN","reason":"SL justification valid","antecedents":["two-pointer-convergence-linear-time","two-pointer-sorted-array-pattern","two-pointer-backward-fill-avoids-sort","sort-then-two-pointer-pattern"],"label":"Two-pointer subsumes multiple problem families into a single O(n) framework"},{"node":"two-pointer-convergence-linear-time","truth_value":"IN","reason":"premise"},{"node":"two-pointer-sorted-array-pattern","truth_value":"IN","reason":"premise"},{"node":"two-pointer-backward-fill-avoids-sort","truth_value":"IN","reason":"premise"},{"node":"mutation-invisible-in-single-call-context","truth_value":"IN","reason":"SL justification valid","antecedents":["in-place-mutation-with-return-convention","no-validation-is-deliberate-contract"],"label":"Mutation is invisible in LeetCode's single-call model, but the documented sort-mutations would surprise any caller that reads the input after the call","outlist":["max-distance-mutates-input","distance-value-mutates-arr2"]},{"node":"in-place-mutation-with-return-convention","truth_value":"IN","reason":"SL justification valid","antecedents":["in-place-mutation-return-convention","in-place-sort-mutation-pattern","assign-cookies-mutates-inputs","fused-reverse-invert"],"label":"The mutate-and-return idiom matches LeetCode's expected interface pattern"},{"node":"in-place-mutation-return-convention","truth_value":"IN","reason":"premise"},{"node":"in-place-sort-mutation-pattern","truth_value":"IN","reason":"premise"},{"node":"assign-cookies-mutates-inputs","truth_value":"IN","reason":"premise"},{"node":"fused-reverse-invert","truth_value":"IN","reason":"premise"},{"node":"no-validation-is-deliberate-contract","truth_value":"IN","reason":"SL justification valid","antecedents":["solutions-no-input-validation","no-input-validation-convention","solutions-trust-leetcode-preconditions","leetcode-solutions-no-validation-convention"],"label":"Validation omission is a consistent design decision, not accumulated technical debt"},{"node":"solutions-no-input-validation","truth_value":"IN","reason":"premise"},{"node":"no-input-validation-convention","truth_value":"IN","reason":"premise"},{"node":"solutions-trust-leetcode-preconditions","truth_value":"IN","reason":"premise"},{"node":"leetcode-solutions-no-validation-convention","truth_value":"IN","reason":"premise"}]}}