{"id":"degree-single-pass-three-dicts","text":"The degree-of-an-array solution populates `count`, `first`, and `last` dictionaries in a single O(n) enumeration, then reduces over degree-tied elements to find the minimum span — no second scan of the input.","truth_value":"IN","source":"entries/2026/06/06/degree-of-an-array-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"degree-single-pass-three-dicts","truth_value":"IN","reason":"premise"}]}}