We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Warmup
  4. Diagonal Difference
  5. Discussions

Diagonal Difference

Sort by

recency

|

5795 Discussions

|

  • sbalajiviswa
     + 0 comments

    python 3:

    def diagonalDifference(arr): return abs(sum([arr[i][i] - arr[i][len(arr)-1-i] for i in range(len(arr)) if i != len(arr)-1-i]))

  • joanrojasp
     + 0 comments

    My C# solution:

        public static int diagonalDifference(List<List<int>> arr)
    {
        int diagonalLeftToRight = 0;
        int diagonalRightToLeft = 0;
        for(int i = 0; i < arr.Count; i++)
        {
            diagonalLeftToRight += arr[i][i];
            diagonalRightToLeft += arr[i][arr[i].Count - (i + 1)];
        }
        return Math.Abs(diagonalLeftToRight - diagonalRightToLeft);
    }

  • praneeykauri
     + 0 comments

    c#

    int diff = 0;
        for(int i=0, j =arr.Count-1; i< arr.Count; i++,j--){
            diff =diff + arr[i][i]- arr[i][j];
        }
        return Math.Abs(diff);

  • danishamanat
     + 0 comments

    c# public static int diagonalDifference(List> arr) { int primary=0; int secondary=0; int sum=0;

        int n = arr.Count()-1;
    int m = arr[0].Count()-1;

    int primaryIndex=0;
    int secondaryIndex=m;

    for(int i = 0; i <= n; i++)
    {
         primary+=arr[i][primaryIndex];
         primaryIndex++;

         secondary+=arr[i][secondaryIndex];
         secondaryIndex--;
    }

    sum=primary-secondary;

    if(sum<0)
        sum=-sum;


    return sum;

}

  • juanalv20
     + 0 comments
    class Result {

    /*
     * Complete the 'diagonalDifference' function below.
     *
     * The function is expected to return an INTEGER.
     * The function accepts 2D_INTEGER_ARRAY arr as parameter.
     */

    public static int diagonalDifference(List<List<Integer>> arr) {
        Integer LeftDiag = 0;
        Integer RightDiag = 0;
        
        for (int i = 0; i < arr.size(); i++) {
            LeftDiag += arr.get(i).get(i);
            RightDiag += arr.get(i).get(arr.size()-1-i);
        }
        
        return Math.abs(LeftDiag-RightDiag);
        
    }

}