Easy to Understand Java Solution
\npublic int orderOfLargestPlusSign(int N, int[][] mines) {\n        int[][] grid = new int[N][N];\n        int ans = 0;\n        for (int i = 0; i < N; i++) {\
```\npublic int orderOfLargestPlusSign(int N, int[][] mines) {\n        int[][] grid = new int[N][N];\n        int ans = 0;\n        for (int i = 0; i < N; i++) {\n            Arrays.fill(grid[i], 1);\n        }\n        \n        for (int[] m : mines) {\n            grid[m[0]][m[1]] = 0;\n        }\n        \n        for(int i = 0; i < N; i++){\n            for(int j = 0; j < N; j++){\n                if(grid[i][j] == 1){\n                    int count = 1;\n                    int dir = 1;\n                    while(j-dir >= 0 && j+dir < N  && i-dir >= 0 && i+dir < N  && \n                         grid[i][j-dir] == 1 && grid[i][j+dir] == 1 && \n                         grid[i-dir][j] == 1 && grid[i+dir][j] == 1){\n                        count++;\n                        dir++;    \n                    }\n                    ans = Math.max(count, ans);\n                }\n            }   \n        }\n        return ans;\n    }\n```
[]