Matrix Diagonal Sum Leetcode Solution

tutorialcup
recent  |  interesting  |  random  |  favorites  |  contacts  |  sets  |  tags:  
Matrix Diagonal Sum Leetcode Solution
Matrix Diagonal Sum Leetcode Solution

Problem Statement
In Matrix Diagonal Sum problem a square matrix of integers is given. We have to calculate the sum of all the elements present at its diagonals i.e. elements at primary diagonal as well as secondary diagonal. Each element should be counted only once.
Example
mat = ,
,
]
25
Explanation:

Diagonals sum: 1 + 5 + 9 + 3 + 7 = 25
Notice that element mat = 5 is counted only once
mat = ,
,
,
]
8
Explanation:

Diagonals sum: (1+1+1+1)+(1+1+1+1)=8.
Approach

In given square matrix we have to just add the diagonal elements and return its sum.
Lets see what will be the indices pattern in the matrix for diagonal elements. First if we see on the primary diagonal, its first element is on index i=0,j=0 and next element is on (i+1,j+1). Similarly last element will be on index (n-1,n-1) where n is the width of the given square matrix. All indices on this diagonal have i=j.
So we can iterate over this diagonal in a loop as follows:

1. Initialise i=0 and j=0.
2. Run a loop while i

www.tutorialcup.com/leetcode-solutions/matrix-diagonal-su...

© All Rights Reserved
Taken on: December 16, 2020
Tags: Everybody's photos tagged with Adobe Adobe Everybody's photos tagged with algorithms algorithms Everybody's photos tagged with Array Array more » Everybody's photos tagged with coding coding Everybody's photos tagged with Easy Easy Everybody's photos tagged with Interview Interview Everybody's photos tagged with interviewprep interviewprep Everybody's photos tagged with LeetCode LeetCode Everybody's photos tagged with LeetCodeSolutions LeetCodeSolutions Everybody's photos tagged with Matrix Matrix « less
Stats: 17 views