Diagonal Difference - HackerRank || HackerRank Diagonal Difference Solution
Problem Name: Diagonal Difference
Judge: HackerRank
Problem link: Diagonal Difference
HackerRank Diagonal Difference Solution in C
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n, i, j, d1 = 0, d2 = 0, substaction;
scanf("%d", &n);
int array[n][n];
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
scanf("%d", &array[i][j]);
if (i == j) d1 = d1 + array[i][j];
if (i + j == n - 1) d2 = d2 + array[i][j];
}
}
substaction = abs(d1 - d2);
printf("%d\n", substaction);
return 0;
}
HackerRank Diagonal Difference Solution in C++/Cpp
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, i, j, d1 = 0, d2 = 0;
cin >> n;
int array[n][n];
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
cin >> array[i][j];
if (i == j) d1 = d1 + array[i][j];
if (i + j == n - 1) d2 = d2 + array[i][j];
}
}
int substraction = abs(d1 - d2);
cout << substraction << endl;
return 0;
}
HackerRank Diagonal Difference Solution in Java
import java.util.Scanner;
public class Diagonal_Difference {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int[][] array = new int[n][n];
int d1 = 0, d2 = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
array[i][j] = input.nextInt();
if (i == j) d1 = d1 + array[i][j];
if (i + j == n - 1) d2 = d2 + array[i][j];
}
}
System.out.println(Math.abs(d1 - d2));
}
}
