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

|

5820 Discussions

|

  • escurraseb92
     + 0 comments

    Solution in C

    public static int diagonalDifference(List<List<int>> arr)
    {
        int left = 0;
        int right = 0 ;
        int indexRight = arr.Count();
        
        
        for(int x=0; x < arr.Count(); x ++){
            indexRight --;
            left += arr[x][x];
            right += arr[x][indexRight];
        }
        
        if(left > right)
            return left - right;
        else
            return right - left;
    }

  • mouha22talibi
     + 0 comments

    Solution in PHP

    function diagonalDifference(array Extra open brace or missing close bracearraySize = count($arr);

        // primary & secondary sum vars
    `$primarySum = $`secondarySum = 0;

    // looping the array
    for (`$x = 0; $`x < `$arraySize; $`x++) {
        // incrementing primary sum 
        `$primarySum += $`arr[`$x][$`x];

        // incrementing secondary sum
        `$secondarySum += $`arr[`$x][$`arraySize - 1 - $x];
    }

    // return absolute diagonal
    return abs(`$primarySum - $`secondarySum);

    };

  • vishalrajpurohi6
     + 0 comments

    Solution in js

    function diagonalDifference(arr) {
    // Write your code here
    let leftToRight = 0
    let rightToLeft = 0
for(let i =0;i<arr.length ;i++){
    leftToRight +=arr[i][i]
    rightToLeft += arr[i][arr.length-1-i]
}
return  Math.abs(leftToRight-rightToLeft)
}

  • vsowmika2004
     + 0 comments
    def diagonalDifference(arr):
    # Write your code here
    ld=rd=0
    for i in range(n):
        ld+=arr[i][i]
        rd+=arr[i][n-1-i]
    if ld > rd:
        return ld - rd
    else:
        return rd - ld

  • SVVBathini
     + 0 comments

    For Python3 Platform

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

n = int(input())

arr = []
for a in range(n):
    arr.append(list(map(int, input().split())))

result = diagonalDifference(arr)

print(result)