{"id":"max-avg-sliding-window-o-n","text":"The maximum average subarray solution runs in O(n) time and O(1) extra space by maintaining a running sum and sliding a fixed-size window.","truth_value":"IN","source":"entries/2026/06/06/maximum-average-subarray-i-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"max-avg-sliding-window-o-n","truth_value":"IN","reason":"premise"}]}}