{"id":"selective-defense-explained-by-judge-boundary","text":"The selective-defense pattern (invest in efficiency-improving conditions like early exit and short-circuit, skip robustness-improving conditions like input validation) is precisely explained by the judge's evaluation boundary: solutions invest in conditions whose payoff is measurable (early exit improves runtime, which the judge times) and skip conditions whose payoff is invisible (validation guards against inputs the judge never sends).","truth_value":"IN","source":"","source_url":"","source_hash":"","justifications":[{"type":"SL","antecedents":["selective-defense-replaces-universal-validation","algorithmic-precision-despite-engineering-neglect"],"outlist":[],"label":"Causal explanation — selective defense follows logically from optimizing for a judge that measures speed but not robustness"}],"dependents":["defense-investment-tracks-judge-reward-signal","streaming-self-sufficiency-explains-selective-defense"],"metadata":{"last_reviewed":"2026-06-07T22:02:22","review_result":"invalid"},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"selective-defense-explained-by-judge-boundary","truth_value":"IN","reason":"SL justification valid","antecedents":["selective-defense-replaces-universal-validation","algorithmic-precision-despite-engineering-neglect"],"label":"Causal explanation — selective defense follows logically from optimizing for a judge that measures speed but not robustness"},{"node":"selective-defense-replaces-universal-validation","truth_value":"IN","reason":"SL justification valid","antecedents":["selective-condition-checking-not-absent","defaults-encode-domain-knowledge-at-every-layer"],"label":"Conditions and defaults are both present but serve optimization not validation — the pattern is deliberate selectivity, not absence of defensive thinking"},{"node":"selective-condition-checking-not-absent","truth_value":"IN","reason":"SL justification valid","antecedents":["early-exit-optimizations-pervasive","no-validation-is-deliberate-contract"],"label":"Early-exit checks + no validation checks = the code checks strategically, not defensively"},{"node":"early-exit-optimizations-pervasive","truth_value":"IN","reason":"SL justification valid","antecedents":["three-consecutive-odds-early-exit","path-crossing-early-exit","isomorphic-early-return","first-violation-sufficiency"],"label":"Early exit is the default control flow strategy, not an optimization afterthought"},{"node":"three-consecutive-odds-early-exit","truth_value":"IN","reason":"premise"},{"node":"path-crossing-early-exit","truth_value":"IN","reason":"premise"},{"node":"isomorphic-early-return","truth_value":"IN","reason":"premise"},{"node":"first-violation-sufficiency","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"},{"node":"defaults-encode-domain-knowledge-at-every-layer","truth_value":"IN","reason":"SL justification valid","antecedents":["counter-universal-frequency-primitive","sentinel-initialization-encodes-boundary-conditions"],"label":"Counter's zero-default and sentinel -1/0/None are the same design principle (meaningful defaults) applied at data-structure vs algorithm level"},{"node":"counter-universal-frequency-primitive","truth_value":"IN","reason":"SL justification valid","antecedents":["counter-dominant-frequency-tool","counter-pattern-dominates-frequency-problems","counter-missing-key-returns-zero","counter-subtraction-drops-nonpositive"],"label":"Counter's built-in semantics eliminate boilerplate that manual dicts would require"},{"node":"counter-dominant-frequency-tool","truth_value":"IN","reason":"premise"},{"node":"counter-pattern-dominates-frequency-problems","truth_value":"IN","reason":"premise"},{"node":"counter-missing-key-returns-zero","truth_value":"IN","reason":"premise"},{"node":"counter-subtraction-drops-nonpositive","truth_value":"IN","reason":"premise"},{"node":"sentinel-initialization-encodes-boundary-conditions","truth_value":"IN","reason":"SL justification valid","antecedents":["ascending-check-uses-sentinel-minus-one","k-length-apart-sentinel-minus-one","prev-zero-sentinel","getheight-sentinel-neg1"],"label":"all four use domain-specific sentinels (-1 for \"no previous index\", 0 for \"no previous group\", -1 for \"any subtree unbalanced\") that make the first loop iteration produce the correct vacuous result without an explicit guard"},{"node":"ascending-check-uses-sentinel-minus-one","truth_value":"IN","reason":"premise"},{"node":"k-length-apart-sentinel-minus-one","truth_value":"IN","reason":"premise"},{"node":"prev-zero-sentinel","truth_value":"IN","reason":"premise"},{"node":"getheight-sentinel-neg1","truth_value":"IN","reason":"premise"},{"node":"algorithmic-precision-despite-engineering-neglect","truth_value":"IN","reason":"SL justification valid","antecedents":["repo-optimized-for-submission-not-engineering","stdlib-reinforces-exactness"],"label":"Submission-optimized engineering + stdlib-reinforced exactness shows the optimization target is judge correctness, not code quality"},{"node":"repo-optimized-for-submission-not-engineering","truth_value":"IN","reason":"SL justification valid","antecedents":["leetcode-judge-optimized-not-reusable","no-consistency-enforcement-at-any-level"],"label":"Judge optimization (no validation, mutation, duplication) combines with absence of enforcement to produce a codebase where correctness is local and accidental consistency is the only kind"},{"node":"leetcode-judge-optimized-not-reusable","truth_value":"IN","reason":"SL justification valid","antecedents":["no-validation-is-deliberate-contract","in-place-mutation-with-return-convention","duplication-over-shared-infrastructure"],"label":"each decision is rational for a judge environment (trusted input, single caller, no shared state) but would be a defect in reusable library code"},{"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":"duplication-over-shared-infrastructure","truth_value":"IN","reason":"SL justification valid","antecedents":["treenode-is-de-facto-shared-via-inline-copies","tree-serialization-helpers-duplicated","per-problem-data-structure-isolation","repo-no-cross-problem-imports"],"label":"Architecture deliberately prioritizes isolation over deduplication"},{"node":"treenode-is-de-facto-shared-via-inline-copies","truth_value":"IN","reason":"premise"},{"node":"tree-serialization-helpers-duplicated","truth_value":"IN","reason":"premise"},{"node":"per-problem-data-structure-isolation","truth_value":"IN","reason":"premise"},{"node":"repo-no-cross-problem-imports","truth_value":"IN","reason":"premise"},{"node":"no-consistency-enforcement-at-any-level","truth_value":"IN","reason":"SL justification valid","antecedents":["isolation-enables-style-drift","test-colocation-dual-mode-inconsistent","duplication-over-shared-infrastructure"],"label":"isolation removes the forcing function, duplication removes the single point of standardization, and dual-mode testing confirms that even simple conventions (where tests live) have drifted"},{"node":"isolation-enables-style-drift","truth_value":"IN","reason":"SL justification valid","antecedents":["repo-no-cross-problem-imports","solution-class-vs-standalone-function","method-name-mismatch-pattern","leetcode-repo-mixed-function-style"],"label":"Zero coupling means zero convention enforcement; each directory evolves independently"},{"node":"solution-class-vs-standalone-function","truth_value":"IN","reason":"premise"},{"node":"method-name-mismatch-pattern","truth_value":"IN","reason":"premise"},{"node":"leetcode-repo-mixed-function-style","truth_value":"IN","reason":"premise"},{"node":"test-colocation-dual-mode-inconsistent","truth_value":"IN","reason":"SL justification valid","antecedents":["tests-colocated-in-solution-file","test-files-import-sibling-solution","some-solutions-bundle-tests-inline","repo-solution-test-convention"],"label":"Both test patterns work but the inconsistency reflects the same isolation-driven style drift as the class-vs-function split"},{"node":"tests-colocated-in-solution-file","truth_value":"IN","reason":"premise"},{"node":"test-files-import-sibling-solution","truth_value":"IN","reason":"premise"},{"node":"some-solutions-bundle-tests-inline","truth_value":"IN","reason":"premise"},{"node":"repo-solution-test-convention","truth_value":"IN","reason":"premise"},{"node":"stdlib-reinforces-exactness","truth_value":"IN","reason":"SL justification valid","antecedents":["python-stdlib-preferred-over-manual-algorithms","exactness-over-performance-at-every-layer"],"label":"Stdlib abstractions inherently provide the exact semantics the repo demands"},{"node":"python-stdlib-preferred-over-manual-algorithms","truth_value":"IN","reason":"SL justification valid","antecedents":["string-over-arithmetic-for-digit-ops","counter-universal-frequency-primitive"],"label":"both patterns reflect the same principle: prefer a well-tested stdlib abstraction over a hand-rolled equivalent, trading minor performance for readability and correctness confidence"},{"node":"string-over-arithmetic-for-digit-ops","truth_value":"IN","reason":"SL justification valid","antecedents":["str-conversion-digit-extraction-idiom","string-based-digit-check-idiom","digit-sum-via-str-conversion","bin-count-for-popcount"],"label":"String conversion is the universal digit-decomposition idiom, chosen for readability over performance"},{"node":"str-conversion-digit-extraction-idiom","truth_value":"IN","reason":"premise"},{"node":"string-based-digit-check-idiom","truth_value":"IN","reason":"premise"},{"node":"digit-sum-via-str-conversion","truth_value":"IN","reason":"premise"},{"node":"bin-count-for-popcount","truth_value":"IN","reason":"premise"},{"node":"exactness-over-performance-at-every-layer","truth_value":"IN","reason":"SL justification valid","antecedents":["integer-arithmetic-avoids-float-precision","string-over-arithmetic-for-digit-ops"],"label":"Both patterns sacrifice theoretical efficiency (string ops are slower than arithmetic, isqrt has overhead) for the same reason: eliminating an entire class of precision bugs rather than reasoning about when they'd actually trigger"},{"node":"integer-arithmetic-avoids-float-precision","truth_value":"IN","reason":"SL justification valid","antecedents":["isqrt-over-sqrt-for-large-inputs","pivot-integer-isqrt-not-sqrt","sum-substitution-avoids-float-precision","percentage-floor-integer-arithmetic"],"label":"four independent solutions independently chose integer arithmetic to dodge the same class of bug (float precision near integer boundaries), indicating a deliberate defensive pattern"},{"node":"isqrt-over-sqrt-for-large-inputs","truth_value":"IN","reason":"premise"},{"node":"pivot-integer-isqrt-not-sqrt","truth_value":"IN","reason":"premise"},{"node":"sum-substitution-avoids-float-precision","truth_value":"IN","reason":"premise"},{"node":"percentage-floor-integer-arithmetic","truth_value":"IN","reason":"premise"}]}}