{"id":"in-place-mutation-with-return-convention","text":"Solutions routinely mutate input data structures (arrays, linked lists, matrices) in-place and return the same reference, blending imperative mutation with functional return-value style.","truth_value":"IN","source":"","source_url":"","source_hash":"","justifications":[{"type":"SL","antecedents":["in-place-mutation-return-convention","in-place-sort-mutation-pattern","assign-cookies-mutates-inputs","fused-reverse-invert"],"outlist":[],"label":"The mutate-and-return idiom matches LeetCode's expected interface pattern"}],"dependents":["input-mutation-convention-coherent","leetcode-judge-optimized-not-reusable","mutation-invisible-in-single-call-context","space-minimization-dual-strategy"],"metadata":{"last_reviewed":"2026-06-07T22:02:22","review_result":"unnecessary"},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"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"}]}}