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

|

683 Discussions

|

  • kumarsahudeepak1
     + 0 comments

    Scala solution

    def diagonalDifference(arr: Array[Array[Int]]): Int = {
    // Write your code here
    val n = arr.length
    var primaryDiagonal = 0
    var secondaryDiagonal = 0

    for (i <- 0 until n) {
        primaryDiagonal += arr(i)(i)
        secondaryDiagonal += arr(i)(n - i - 1)
    }

    Math.abs(primaryDiagonal - secondaryDiagonal)

    }

  • kawaconcept_equ1
     + 0 comments
    def diagonalDifference(arr):
    a, b = [], []
    [a.append(arr[i][i]) for i in range(n)]
    [b.append(arr[i][-i-1]) for i in range(n)]
    return abs(sum(a) - sum(b))

  • ataquecardiacob1
     + 0 comments

    C#

    public static int diagonalDifference(List<List<int>> arr, int size)
    {
        var lsum = 0;
        var rsum = 0;
        
        for (var xl = 0; xl < size; xl++) {
            lsum += arr[xl][xl];
            rsum += arr[xl][size - 1 - xl];
        }
        
        return Math.Abs(lsum - rsum);
    }

  • akulbachandra67
     + 0 comments
        a = 0
    b = 0    
    for i in range(n):
        for j in range(n):
            if i == j :
                a += c[i][j]
            if i+j == n-1 :
                b += c[i][j]   
    return abs(a-b)

  • patrick_adeleye
     + 0 comments
    for i in range(numrows):
    if(i < numcols):
        left_score += arr[i][i]
        right_score += arr[i][(numcols - 1) - (i)]

total_dif = abs(left_score - right_score)
print(left_score, right_score )
return total_dif