Available question text
Replace each element in a circular array with the sum of the next k elements (if k>0), the previous |k| elements (if k<0), or 0 (if k==0), with indices wrapping around. This is a sliding-window/prefix-sum pattern on a circular array requiring careful wrap-around handling.
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 1652. Defuse the Bomb
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source