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

|

323 Discussions

|

  • 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);
    }

  • PThie
     + 0 comments

    Python Solution

    def diagonalDifference(arr):
    n = len(arr)
    
    LR = 0
    RL = 0
    for i in range(n):
        LR += arr[i][i]
        RL += arr[n-1-i][i]
        
    return abs(LR - RL)

  • that_real_throw1
     + 0 comments

    Javascript

    function diagonalDifference(arr) {
    const len = arr.length;
    let d1 = 0;
    let d2 = 0;
    for(let i=0; i<len; i++) {
        d1+= arr[i][i];
        d2+= arr[i][len-1-i];
    }
    return Math.abs(d1 - d2);
}