Diagonal Difference

Sort by

recency

|

5768 Discussions

|

  • + 0 comments

    Swift: easy to read O(n)

    func diagonalDifference(arr: [[Int]]) -> Int { // Write your code here let length = arr.count var leftDiagnolSum = 0 var rightDiagnolSum = 0

    for i in (0..<length) {
        leftDiagnolSum += arr[i][i]
        rightDiagnolSum += arr[(length - 1) - i][i]
    }
    
    let difference = leftDiagnolSum - rightDiagnolSum
    return difference >= 0 ? difference : difference * -1
    

    }

  • + 0 comments

    I don't understand why the function doesn't get the number of lines passed in as a parameter. It seems like bad design to have to access that globally

  • + 0 comments
    1. n = int(input())
    2. li = []
    3. d1 = 0
    4. d2 = 0
    5. for i in range(n):
    6. i = list(map(int,input().split()))
    7. li.append(i)
    8. for j in range(len(li)):
    9. d1+=li[j][j]
    10. d2+=li[j][n-1-j]
    11. print(abs(d1-d2))
  • + 0 comments
    int f_diag{},s_diag{};
    int col=arr[1].size()-1;
    for(int row=0;row<arr[0].size();row++)
    {
        f_diag+=arr[row][row];
        s_diag+=arr[col][row];
        col--;
    }
    return abs(f_diag-s_diag);
    
  • + 0 comments

    def diagonalDifference(arr): primary_diagonal_sum = 0 secondary_diagonal_sum = 0 n = len(arr) for i in range(n): primary_diagonal_sum += arr[i][i] secondary_diagonal_sum += arr[i][n - 1 - i]

    return abs(primary_diagonal_sum - secondary_diagonal_sum)