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.
Loading...
  1. Practice
  2. Data Structures
  3. Arrays
  4. Array Manipulation
  5. Discussions

Array Manipulation

  • mevtew + 1 comment

    simpler in es6:

    function arrayManipulation(n, queries) { let arr = new Array(2*n).fill(0); let max = 0;

    queries.forEach((item) => {
    arr[item[0]] += item[2];
    arr[item[1] + 1] -= item[2];
});

arr.reduce((prev, curr, idx) => {
    const sum = prev + curr;
    if (sum > max) {
        max = sum;
    }

    return sum;
})

return max;

    }

    • Rockyfive + 1 comment

      I did something pretty similar, just with a little bit more readable forEach:

      const arr = new Array(n).fill(0);
let result = 0;

queries.forEach(([a, b, k]) => {
    arr[a - 1] += k;
    if (b < arr.length) {
        arr[b] -= k;
    }
});

arr.reduce((a, b) => {
    const acc = a + b;
    result = Math.max(result, acc);
    return acc;
}, 0);

return result;
      • susahin80 + 1 comment

        This produces wrong answer in some of the tests.

        • Kanahaiya + 0 comments

          Hi,

          try this. Here is the video tutorial for my solution O(n+m) complexity.

          https://www.youtube.com/watch?v=hDhf04AJIRs&list=PLSIpQf0NbcCltzNFrOJkQ4J4AAjW3TSmA

          Would really appreciate your feedback like and comment etc. on my video.