{"id":"single-pass-max-tracking-idiom","text":"The repo prefers single-pass algorithms with running accumulators over multi-pass approaches that materialize intermediate lists, as seen in rectangle counting (O(n) with running max+count) and line writing (O(n) greedy scan)","truth_value":"IN","source":"entries/2026/06/06/number-of-rectangles-that-can-form-the-largest-square-solution.md, entries/2026/06/06/number-of-lines-to-write-string-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"single-pass-max-tracking-idiom","truth_value":"IN","reason":"premise"}]}}