/* Hackerrank -> Dashboard -> Algorithms -> Warmup -> Diagonal Difference Given a square matrix of size N X N, calculate the absolute difference between the sums of its diagonals. Input Format The first line contains a single integer, N. The next N lines denote the matrix's rows, with each line containing N space-separated integers describing the columns. Constraints -100 <= elements <= 100 Output Format Print the absolute difference between the two sums of the matrix's diagonals as a single integer. Sample Input 3 11 2 4 4 5 6 10 8 -12 Sample Output 15 Explanation The primary diagonal is: 11 5 -12 Sum across the primary diagonal: 11 + 5 - 12 = 4 The secondary diagonal is: 4 5 10 Sum across the secondary diagonal: 4 + 5 + 10 = 19 Difference: |4 - 19| = 15 */ #include #include #include #include #include using namespace std; class Matrix{ public: void setWidth(int w) { width = w; } void setHeight(int h) { height = h; } void setElements(vector > arr){ element = arr; } protected: int width; int height; vector > element; }; class Determinant: public Matrix{ public: vector primary_diag(){ vector pdiag; for(int w = 0; w < width; w++){ pdiag.push_back(element[w][w]); } return pdiag; } vector secondary_diag(){ vector sdiag; for(int w = 0; w < width; w++){ sdiag.push_back(element[w][width-w-1]); } return sdiag; } int diag_diff(){ vector pdiag = primary_diag(); vector sdiag = secondary_diag(); int sum_pdiag = 0; int sum_sdiag = 0; for(int w = 0; w < width; w++){ sum_pdiag += pdiag[w]; sum_sdiag += sdiag[w]; } return abs(sum_pdiag - sum_sdiag); } }; int main(){ int n; cin >> n; vector< vector > a(n,vector(n)); for(int a_i = 0;a_i < n;a_i++){ for(int a_j = 0;a_j < n;a_j++){ cin >> a[a_i][a_j]; } } Determinant Det0; Det0.setWidth(n); Det0.setElements(a); cout << Det0.diag_diff()<

diagonal difference solution in C++