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:
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
- Find smallest and largest element from square matrix diagonals
- Find the product of sum of two diagonals of a square Matrix
- Sum of both diagonals of a spiral odd-order square matrix
- Sum of all parts of a square Matrix divided by its diagonals
- Return an array of anti-diagonals of given N*N 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
- Check if a matrix contains a square submatrix with 0 as boundary element
- Program to print the Diagonals of a Matrix
- Program to Interchange Diagonals of Matrix
- Efficiently compute sums of diagonals of a matrix
- Program to print the Diagonals of a Matrix in O(N) time
- Number of cells in the right and left diagonals passing through (x, y) in a matrix
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.