We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Arrays
  4. Array Manipulation
  5. Discussions

Array Manipulation

  • jstew1974
     + 0 comments

    Best solution right here. I was able to brute force it but a few test cases were failing. I implemented your aglorithm in Go and it works great. All test cases passing.

    func arrayManipulation(n int32, queries [][]int32) int64 {
    var max int64
    var arr = make([]int64, n)
    
    for _, q := range queries {
        a, b, k := q[0], q[1], int64(q[2])

        arr[a-1] += k
        if b < n { arr[b] -= k }
    }

    var sum int64
    for _, n := range arr {
        sum = sum + n
        if sum > max { max = sum }
    }

    return max
}