hackerrank diagonal difference python code example
Example 1: diagonal difference hackerrank python
prim =0
sec=0
length = len(arr[0])
for count in range(length):
prim += arr[count][count]
sec += arr[count][(length-count-1)]
return abs(prim-sec)
Example 2: 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))