How To Find The Diagonal Difference : Hackerrank Solved

 In this articles we are going to cover up Diagonal Difference problem of Hackerrank. We are going to implement the answer for this this in two different ways first is with the help of  Loop and another one using recursive function, so without wasting any time let's see the question first and then we're going to implement a solution for this problem.

Diagonal Difference

Given a square matrix, calculate the absolute difference between the sums of its diagonals.

For example, the square matrix  is shown below: 

1 2 3
4 5 6
9 8 9  

The left-to-right diagonal = . The right to left diagonal = . Their absolute difference is .

Function description

Complete the  function in the editor below.

diagonalDifference takes the following parameter:

• int arr[n][m]: an array of integers

Return

• int: the absolute diagonal difference

Input Format

The first line contains a single integer, , the number of rows and columns in the square matrix .
Each of the next  lines describes a row, , and consists of  space-separated integers .

Constraints

Output Format

Return the absolute difference between the sums of the matrix's two diagonals as a single integer.

Sample Input

3
11 2 4
4 5 6
10 8 -12

Sample Output

15

Explanation

The primary diagonal is:

11
   5
     -12

Sum across the primary diagonal: 11 + 5 - 12 = 4

The secondary diagonal is:

     4
   5
10

Sum across the secondary diagonal: 4 + 5 + 10 = 19
Difference: |4 - 19| = 15

1. Using Loop

1. Using Recursive Function

Checkout for more Algorithms Answers : Read More