C++ Program to Maximize sum of diagonal of a matrix by rotating all rows or all columns

// C++ program to implement
// the above approach

#include <bits/stdc++.h>
using namespace std;
#define N 3


// Function to find maximum sum of diagonal elements 
// of matrix by rotating either rows or columns
int findMaximumDiagonalSumOMatrixf(int A[][N])
{
    
    
    // Stores maximum diagonal sum of elements
    // of matrix by rotating rows or columns
    int maxDiagonalSum = INT_MIN;
    

    // Rotate all the columns by an integer
    // in the range [0, N - 1]
    for (int i = 0; i < N; i++) {
        

        // Stores sum of diagonal elements
        // of the matrix
        int curr = 0;
        

        // Calculate sum of diagonal 
        // elements of the matrix
        for (int j = 0; j < N; j++) {
            

            // Update curr
            curr += A[j][(i + j) % N];
        }
        
        
        // Update maxDiagonalSum
        maxDiagonalSum = max(maxDiagonalSum, 
                                      curr);
    }


    // Rotate all the rows by an integer
    // in the range [0, N - 1]
    for (int i = 0; i < N; i++) {
        

        // Stores sum of diagonal elements
        // of the matrix
        int curr = 0;
        

        // Calculate sum of diagonal 
        // elements of the matrix
        for (int j = 0; j < N; j++) {
            

            // Update curr
            curr += A[(i + j) % N][j];
        }
        
        
        // Update maxDiagonalSum
        maxDiagonalSum = max(maxDiagonalSum, 
                                      curr);
    }

      
    return maxDiagonalSum;
}


// Driver code
int main()
{
    
    int mat[N][N] = { { 1, 1, 2 }, 
                    { 2, 1, 2 }, 
                    { 1, 2, 2 } };
    
    cout<< findMaximumDiagonalSumOMatrixf(mat);
    return 0;
}