Implement a segment tree over an integer array supporting two operations applied in order: ['assign', l, r,…

Question

Implement a segment tree over an integer array supporting two operations applied in order: ['assign', l, r, v] sets every element in the inclusive index range [l, r] to v, and ['sum', l, r] returns the sum over [l, r]. Given the initial array and the operation list, return the list of answers to the 'sum' queries in order. Use lazy propagation so each operation is O(log n).

Prep Room · Answer

**Intuition** We need range-assign (set [l,r] to v) and range-sum, both fast. A segment tree over a power-of-two-padded array gives O(log n) per op, and lazy…

Segment tree range assign