{"id":"distinct-elements-enables-first-element-argmax","text":"With distinct elements, the lexicographically largest subarray of length k always starts at the position of the maximum value in `nums[0:n-k+1]` — no need to compare subsequent elements.","truth_value":"IN","source":"entries/2026/06/06/largest-subarray-length-k-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"distinct-elements-enables-first-element-argmax","truth_value":"IN","reason":"premise"}]}}