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

|

687 Discussions

|

  • crono7
     + 0 comments

    Java

    int sumLeftToRight = 0, sumRightoLeft = 0;
        for(int i = 0; i < arr.size(); i++){
            sumLeftToRight += arr.get(i).get(i);
            sumRightoLeft += arr.get(i).get(arr.size()-i-1);
        }
        return Math.abs(sumLeftToRight - sumRightoLeft);

  • linnsharonn
     + 0 comments

    Js/Ts

    function diagonalDifference(arr: number[][]): number {
   
    let matrixSize = arr.length;
		
    let sumFirstDiag = 0;
		
    let sumSecondDiag = 0;
    
    for (let rows = 0, cols = matrixSize-1; rows < matrixSize; rows ++, cols--){
        sumFirstDiag += arr[rows][rows];

        sumSecondDiag += arr[rows][cols];

    }
    const result = Math.abs(sumFirstDiag - sumSecondDiag);    
   
    return result;

}

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

  • zgaurd99
     + 0 comments

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

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

    }