my solution - java - easy - accepted - time & space - O(N^2)
\nclass Solution {\n    public int orderOfLargestPlusSign(int n, int[][] mines) {\n        \n        return method1(n,mines);\n        \n    }\n    \n    privat
```\nclass Solution {\n    public int orderOfLargestPlusSign(int n, int[][] mines) {\n        \n        return method1(n,mines);\n        \n    }\n    \n    private int method1(int n,int[][] mines){\n        \n        int[][] mat = new int[n][n];\n        for(int[] arr:mat){\n            Arrays.fill(arr,1);\n        }\n        for(int[] mine:mines){\n            mat[mine[0]][mine[1]]=0;\n        }\n        \n        int maxOrder=0;\n        for(int i=0;i<n;i++){\n            for(int j=0;j<n;j++){\n                \n                if(mat[i][j]==1){\n                    int order=1;\n                    \n                    while(true){\n                        int left = j-order;\n                        int right = j+order;\n                        int top = i-order;\n                        int down = i+order;\n                        \n                        if(left<0||right>=n||top<0||down>=n||\n                           mat[i][right]==0||mat[i][left]==0||mat[top][j]==0||mat[down][j]==0){\n                            break;\n                        }\n                        order++;\n                        \n                    }\n                    \n                    maxOrder = Math.max(maxOrder,order);\n                }\n            }\n        }\n        return maxOrder;\n        \n        \n    }\n}\n```\n**do upvote, if you like my approach**
['Java']