Given a square matrix, the task is to find the element of the matrix where the right and the left diagonal of this square matrix converge.
Input: n = 5, matrix = [ 1 2 3 4 5 5 6 7 8 6 9 5 6 8 7 2 3 5 6 8 1 2 3 4 5 ] Output: 6 Input: n = 4, matrix = [ 1 2 3 4 5 6 7 8 9 0 1 2 4 5 6 1 ] Output: NULL Here there no converging element at all. Hence the answer is null.
- If the number of rows and column of the matrix are even, then we just print NULL because there would be no converging element in the case of even number of rows and column.
- If the number of rows and column of the matrix are odd, find the mid-value of n as
mid = n/2
- The arr[mid][mid] itself is the converging diagonal element.
Below is the implementation of the above approach:
- Find smallest and largest element from square matrix diagonals
- Sum of both diagonals of a spiral odd-order square matrix
- Row-wise common elements in two diagonals of a square matrix
- Swap major and minor diagonals of a square matrix
- Center element of matrix equals sums of half diagonals
- Finding the maximum square sub-matrix with all equal elements
- Program to Interchange Diagonals of Matrix
- Program to print the Diagonals of a Matrix
- Program to print the Diagonals of a Matrix in O(N) time
- Efficiently compute sums of diagonals of a matrix
- Number of cells in the right and left diagonals passing through (x, y) in a matrix
- Check if matrix can be converted to another matrix by transposing square sub-matrices
- Finding the Frobenius Norm of a given matrix
- Finding inverse of a matrix using Gauss - Jordan Method | Set 2
- Element in a matrix starting from which anti-clockwise traversal ends at the last element
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.