Diagonal Difference

Sort by

recency

|

685 Discussions

|

  • + 0 comments

    public static int diagonalDifference(List> arr) { int d1Sum = 0; int d2Sum = 0; for (int i =0; i < arr.size(); i++) { d1Sum = d1Sum + arr.get(i).get(i); d2Sum = d2Sum + arr.get(i).get(arr.size()-1 -i); }

        return Math.abs(d1Sum-d2Sum);
    }
    
  • + 0 comments

    int result = 0; for(int i =0; i

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