Easy Solution in cpp
\nclass Solution {\npublic:\n    int orderOfLargestPlusSign(int n, vector<vector<int>>& mines) {\n        vector<vector<int>>matrix (n,vector<int>(n,n));\n     
```\nclass Solution {\npublic:\n    int orderOfLargestPlusSign(int n, vector<vector<int>>& mines) {\n        vector<vector<int>>matrix (n,vector<int>(n,n));\n        \n        for(int i=0 ; i<n ; i++) {\n            for(int j=0 ; j<n ; j++) {\n                matrix[i][j] = 1 ;\n            }\n        }\n        for(auto mine : mines) {\n            matrix[mine[0]][mine[1]] = 0 ;\n        }\n        \n        vector<vector<int>>left (n,vector<int>(n,n));\n        vector<vector<int>>right (n,vector<int>(n,n));\n        vector<vector<int>>top (n,vector<int>(n,n));\n        vector<vector<int>>bottom (n,vector<int>(n,n));\n        \n        for(int i=0 ; i<n ; i++) {\n            for(int j=0 ; j<n ; j++) {\n                if(matrix[i][j] == 0) {\n                    left[i][j] = 0 ;\n                    top[i][j] = 0 ;\n                } else {\n                    if(i==0) {\n                        top[i][j] = 1 ;\n                    } else {\n                        top[i][j] = top[i-1][j] + 1 ;\n                    }\n                    if(j==0) {\n                        left[i][j] = 1 ;\n                    } else {\n                        left[i][j] = left[i][j-1] + 1 ;\n                    }\n                }\n            }\n        }\n        \n        for(int i=n-1 ; i>=0 ; i--) {\n            for(int j=n-1 ; j>=0 ; j--) {\n                if(matrix[i][j] == 0) {\n                    right[i][j] = 0 ;\n                    bottom[i][j] = 0 ;\n                } else {\n                    if(i==n-1) {\n                        right[i][j] = 1 ;\n                    } else {\n                        right[i][j] = right[i+1][j] + 1 ;\n                    }\n                    if(j==n-1) {\n                        bottom[i][j] = 1 ;\n                    } else {\n                        bottom[i][j] = bottom[i][j+1] + 1 ;\n                    }\n                }\n            }\n        }\n        int ans = INT_MIN ;\n        for(int i=0 ; i<n ; i++) {\n            for(int j=0 ; j<n ; j++) {\n                ans = max(ans, min(min(left[i][j],bottom[i][j]),min(right[i][j],top[i][j]))) ;\n            }\n        }\n        return ans ;\n        \n        \n    }\n};\n```
[]