MCPcopy Create free account
hub / github.com/Tiwarishashwat/InterviewCodes / findColSum

Method findColSum

MagicSquaresInGrid.java:26–43  ·  view source on GitHub ↗
(int grid[][], int r, int c)

Source from the content-addressed store, hash-verified

24 }
25
26 public int findColSum(int grid[][], int r, int c){
27 int sum=0;
28 for(int j=0;j<3;j++){
29 int colSum=0;
30 for(int i=0;i<3;i++){
31 int val = grid[r+i][c+j];
32 colSum+=val;
33 }
34 if(j==0){
35 sum = colSum;
36 }else{
37 if(sum!=colSum){
38 return -1;
39 }
40 }
41 }
42 return sum;
43 }
44
45 public int diagonalSum(int grid[][], int r, int c){
46 int sum1 = grid[r][c] + grid[r+1][c+1] + grid[r+2][c+2];

Callers 1

isMagicSquareMethod · 0.95

Calls

no outgoing calls

Tested by

no test coverage detected