Skip to content

Commit 43c8269

Browse files
author
Gonzalo Diaz
committed
[Hacker Rank]: Diagonal Difference solved ✓
1 parent a7e62bc commit 43c8269

File tree

3 files changed

+146
-0
lines changed

3 files changed

+146
-0
lines changed
Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
namespace algorithm_exercises_csharp.hackerrank;
2+
3+
[TestClass]
4+
public class DiagonalDifferenceTest
5+
{
6+
[TestMethod]
7+
public void testDiagonalDifference()
8+
{
9+
List<List<int>> arr = [
10+
[11, 2, 4],
11+
[4, 5, 6],
12+
[10, 8, -12]
13+
];
14+
int expectedAnswer = 15;
15+
int result = DiagonalDifference.diagonalDifference(arr);
16+
17+
Assert.AreEqual(expectedAnswer, result);
18+
}
19+
}
20+
Lines changed: 40 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,40 @@
1+
// @link Problem definition [[docs/hackerrank/warmup/diagonal_difference.md]]
2+
3+
namespace algorithm_exercises_csharp.hackerrank;
4+
5+
using System.Diagnostics.CodeAnalysis;
6+
7+
public class DiagonalDifference
8+
{
9+
[ExcludeFromCodeCoverage]
10+
protected DiagonalDifference() { }
11+
12+
public static int diagonalDifference(List<List<int>> _arr)
13+
{
14+
int diag1 = 0;
15+
int diag2 = 0;
16+
int last = _arr.Count - 1;
17+
18+
int i = 0;
19+
foreach (List<int> line in _arr)
20+
{
21+
int j = 0;
22+
foreach (int cell in line)
23+
{
24+
if (i == j)
25+
{
26+
diag1 += cell;
27+
diag2 += _arr[last - i][j];
28+
}
29+
30+
j += 1;
31+
}
32+
33+
i += 1;
34+
}
35+
36+
int result = Math.Abs(diag1 - diag2);
37+
return result;
38+
}
39+
40+
}
Lines changed: 86 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,86 @@
1+
# [Diagonal Difference](https://www.hackerrank.com/challenges/diagonal-difference)
2+
3+
Difficulty: #easy
4+
Category: #warmup
5+
6+
Given a square matrix, calculate the absolute difference between the sums
7+
of its diagonals.
8+
For example, the square matrix $ arr $ is shown below:
9+
10+
```text
11+
1 2 3
12+
4 5 6
13+
9 8 9
14+
```
15+
16+
The left-to-right $ diagonal = 1 + 5 + 9 = 15 $.
17+
The right to left $ diagonal = 3 + 5 + 9 = 17 $.
18+
Their absolute difference is $ |15 - 17| = 2 $.
19+
20+
## Function description
21+
22+
Complete the $ diagonalDifference $ function in the editor below.
23+
diagonalDifference takes the following parameter:
24+
25+
- int ` arr[n][m] `: an array of integers
26+
27+
## Return
28+
29+
- int: the absolute diagonal difference
30+
31+
## Input Format
32+
33+
The first line contains a single integer, n, the number of
34+
rows and columns in the square matrix arr.
35+
Each of the next n lines describes a row, arr[i], and consists of
36+
space-separated integers ` arr[i][j] `.
37+
38+
## Constraints
39+
40+
$ -100 \leq $ ` arr[i][j] ` $ \leq 100 $
41+
42+
## Output Format
43+
44+
Return the absolute difference between the sums of the matrix's
45+
two diagonals as a single integer.
46+
47+
## Sample Input
48+
49+
```text
50+
3
51+
11 2 4
52+
4 5 6
53+
10 8 -12
54+
```
55+
56+
Sample Output
57+
58+
```text
59+
15
60+
```
61+
62+
## Explanation
63+
64+
The primary diagonal is:
65+
66+
```text
67+
11
68+
5
69+
-12
70+
```
71+
72+
Sum across the primary diagonal: 11 + 5 - 12 = 4
73+
The secondary diagonal is:
74+
75+
```text
76+
4
77+
5
78+
10
79+
```
80+
81+
Sum across the secondary diagonal: $ 4 + 5 + 10 = 19 $
82+
Difference: $ |4 - 19| = 15 $
83+
84+
*Note*: $ |x| $ is the
85+
[absolute value](https://www.mathsisfun.com/numbers/absolute-value.html)
86+
of $ x $

0 commit comments

Comments
 (0)