# diagonal difference hackerrank solution in java

Today, We want to share with you diagonal difference hackerrank solution in java.In this post we will show you diagonal hackerrank, hear for plus minus hackerrank solutions in java we will give you demo and example for implement.In this post, we will learn about queue applications with an example.

## diagonal difference hackerrank solution in java 8 using list

Contents

Example 1: diagonal difference hackerrank solutions in java 8 using list

``` public static int diagonalDifference(List<List<Integer>> arr) {
// Write your some logic code here
int leftd=0;
int rightd=0;
int n=arr.size();
for(int i=0;i<n;i++)
{
leftd+=arr.get(i).get(i);
rightd+=arr.get(i).get(n-i-1);
}
int absd=Math.abs(leftd-rightd);
return absd;

}
```

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

```

I hope you get an idea about https www hackerrank com challenges diagonal difference problem.
I would like to have feedback on my infinityknow.com blog.