Matrix Diagonal Sum LeetCode solution in JavaScript

1
var diagonalSum = function (mat) {
2
return mat.reduce((acc, matrix, i) => {
3
const matrixlength = matrix.length - 1;
4
return (acc +=
5
i !== matrixlength - i
6
? matrix[i] + matrix[matrixlength - i]
7
: matrix[i]);
8
}, 0);
9
};
10

11
/*
12
Runtime: 67 ms, faster than 92.84% of JavaScript online submissions for Matrix Diagonal Sum.
13
Memory Usage: 42.9 MB, less than 88.29% of JavaScript online submissions for Matrix Diagonal Sum.
14
*/

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0