NickSubmissionChallenge1

int diagonalDifference(vector<vector<int>> arr)
{
    int n = arr.size();

    //Sum primary and secondary diagonal
    int primaryDiag = 0;
    int secondaryDiag = 0;
    for (int i = 0; i < n; i++)
    {
        primaryDiag += arr[i][i];
        secondaryDiag += arr[i][(n-1)-i];
    }

    return abs(primaryDiag - secondaryDiag);
}