Hey, I did the code in Java8 and my code is getting failed for input type - where only single value is present in a row of array. meaning only left index value is provided and right and k value is missing from array. So can you help me how to solve this issue?

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;

}

Your last for loop isn't needed. You can move Math.max to the previous for loop.

Added some ES6 syntax suger...

const arrayManipulation2 = (n, queries) => {
  const arr = new Array(n).fill(0);
  let max = 0;
  for (let i = queries.length - 1; i >= 0; i--) {
    const [a, b, k] = queries[i];
    arr[a - 1] += k;
    if (b < arr.length) {
      arr[b] -= k;
    }
  }
  for (let j = 1; j < n; j++) {
    arr[j] += arr[j - 1];
  }
  for (let k = arr.length - 1; k >= 0; k--) {
    max = Math.max(max, arr[k]);
  }
  return max;
};

Got stuck because of this

max = Math.max(...arr); // not working for big arrays

Thanks man!

You could simplify your code a smidge, and save a little processing power, by removing your final for loop, and putting in an if check in the second to last loop, like this:

for (let j = 1; j < n; j++) {
	arr[j] += arr[j-1];
	
	if (arr[i] > biggest) {
		biggest = arr[i];
	}
}

My js solution ran out of time for a few test cases

function arrayManipulation(n, queries) { let a = new Array(n).fill(0); for(let j = 0; j < queries.length; j++) { let temp = queries[j] let k = temp[0]; while(k <= temp[1]) { a[k-1] += temp[2]; k++; }

} return Math.max.apply(Math, a); }