/Python/Diagonal difference hackerrank solution in python

Diagonal difference hackerrank solution in python

def diagonalDifference(arr):
    # Write your code here
    d1 =0
    d2=0
    for i in range(len(arr[0])):
        d1 += arr[i][i]
        d2 += arr[i][(len(arr[0])-i-1)]
    return abs(d1-d2)

Diagonal difference hackerrank solution in python

def diagonalDifference(arr):
    # Write your code here
    d1 = sum([arr[x][x] for x in range(len(arr))])
    d2 = sum([arr[x][n - 1 - x] for x in range(len(arr))])
    return(abs(d1 - d2))

Source: shareablecode.com

Similar codes

0 vote168 views2 answers
Sumx and ABS in power bi
Python
1 vote187 views3 answers
Random choice sampling numpy
Python
0 vote202 views1 answer
Python change terminal name
Python
0 vote193 views1 answer
Random with probability python
Python
6 votes169 views1 answer
Selectfield flask wtf
Python
12 votes175 views5 answers
Turtle write
Python
2 votes167 views1 answer
Module 'pygame' has no 'init' member
Python
2 votes170 views2 answers
Densenet python keras
Python
0 vote164 views1 answer
Num = [7,8, 120, 25, 44, 20, 27] newnum = [] def remove_even(num): for i in num: if i%2 != 0: newnum.append(i) return newnum print("get_unevens") test(remove_even(num), [7,25,27])
Python
0 vote176 views1 answer
List square python
Python