Leetcode 1652. Defuse the Bomb
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.