Available question text
Given a circular array and integer k, find the minimum number of ±1 element operations to make every length-k subarray sum equal; this reduces to grouping indices into gcd(n,k) cycles via i -> (i+k) mod n and independently equalizing each cycle (choose the median value to minimize total L1 adjustments).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2607. Make K-Subarray Sums Equal
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source