Algorithm · Uber · Hard
You receive an integer array nums with length n plus a two-dimensional integer array queries, where each entry is written as queries[i] = [li, ri, vali]. For each position j in the inclusive interval li <= j <= ri, you can reduce nums[j] by any whole-number value from 0 through vali. Different positions may use different reduction amounts. Return true when all queries can be applied in a way that turns nums into a Zero Array, meaning every entry equals 0; otherwise, return…
Checking your access…