{"id":"maxpower-linear-time","text":"`maxPower` runs in O(n) time and O(1) space using a single-pass \"current vs. previous\" scan — the canonical pattern for run-length problems.","truth_value":"IN","source":"entries/2026/06/06/consecutive-characters-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"maxpower-linear-time","truth_value":"IN","reason":"premise"}]}}