diagonal difference hackerrank solution in java 8 code example

Example: 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)