{"id":"degree-span-minimum-over-ties","text":"The degree-of-an-array return value considers all elements tied at the maximum frequency, not just the first one found — `min(last[n] - first[n] + 1 for n in count if count[n] == degree)`.","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-span-minimum-over-ties","truth_value":"IN","reason":"premise"}]}}