# LeetCode 1572. Matrix Diagonal Sum

## Description

https://leetcode.com/problems/matrix-diagonal-sum/

Given a square matrix `mat`, return the sum of the matrix diagonals.

Only include the sum of all the elements on the primary diagonal and all the elements on the secondary diagonal that are not part of the primary diagonal.

Example 1:

```Input: mat = [[1,2,3],
[4,5,6],
[7,8,9]]
Output: 25
Explanation: Diagonals sum: 1 + 5 + 9 + 3 + 7 = 25
Notice that element mat = 5 is counted only once.
```

Example 2:

```Input: mat = [[1,1,1,1],
[1,1,1,1],
[1,1,1,1],
[1,1,1,1]]
Output: 8
```

Example 3:

```Input: mat = []
Output: 5
```

Constraints:

• `n == mat.length == mat[i].length`
• `1 <= n <= 100`
• `1 <= mat[i][j] <= 100`

## Explanation

Diagonal condition (i == j) or (j == len(mat) – 1 – i).

## Python Solution

``````class Solution:
def diagonalSum(self, mat: List[List[int]]) -> int:

result = 0

for i in range(len(mat)):
for j in range(len(mat)):
if (i == j) or (j == len(mat) - 1 - i):
result += mat[i][j]

return result``````
• Time Complexity: O(N^2)
• Space Complexity: O(1)