Zero array after range-decrement queries
You get an array of non-negative integers and a list of queries [l, r]. Each query lets you subtract 1 from any chosen positions between l and r. Decide whether the array can be all zeros after every query has been used.
Aim for O(n + q) with a difference array.
No answer yet. Write the first one; the best answer gets endorsed.
