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. Diagonal Difference
  2. Discussions

Diagonal Difference

Sort by

recency

|

325 Discussions

|

  • nikhil_v_kumar
     + 0 comments
    def diagonalDifference(arr):
    x = 0
    y = 0
    
    for i in range(len(arr)):
        x += arr[i][i]
        y += arr[i][len(arr)-1-i]
    return(abs(x-y))

  • exelure
     + 0 comments

    Golang

    func diagonalDifference(arr [][]int32) int32 {
    var sum1, sum2 int32
    for i, _ := range arr {
        sum1 += arr[i][i]
        sum2 += arr[len(arr) - i - 1][i]
    }
    return int32(math.Abs(float64(sum1 - sum2)))
}

  • anarod_val25
     + 0 comments

    C++ int diagonalDifference(vector> arr) { int ltr = 0; int rtl = 0; int len = arr.size();

    for (int i = 0; i<len; i++){
    ltr += arr[i][i];
    rtl += arr[i][len-1-i];
}

std::cout<<std::abs(ltr - rtl)<<std::endl;

return std::abs(ltr - rtl);

    } `

  • calancea_bianca1
     + 0 comments

    Python 

    def diagonalDifference(arr):
    # Write your code here
    sum_d1=sum([arr[i][i] for i in range(0,len(arr))])
    sum_d2=sum([arr[i][len(arr)-i-1] for i in range(0,len(arr))])
    
    
    return(abs(sum_d1-sum_d2))

  • crono7
     + 0 comments

    Java

    public static int diagonalDifference(List<List<Integer>> arr) {
        int leftsum = 0, rightsum = 0;
        for(int i = 0; i < arr.size(); i++){
            leftsum += arr.get(i).get(i);
            rightsum += arr.get(arr.size() - (i + 1) ).get(i);
        }

        return Math.max(rightsum, leftsum) - Math.min(rightsum, leftsum);
    }