Python straightforward simple self-explanatory AC solution 
\nclass Solution:\n    def orderOfLargestPlusSign(self, N, mines):\n        #up, left, down, right\n        dp, res, mines = [[[0, 0, 0, 0] for j in range(N)] f
```\nclass Solution:\n    def orderOfLargestPlusSign(self, N, mines):\n        #up, left, down, right\n        dp, res, mines = [[[0, 0, 0, 0] for j in range(N)] for i in range(N)], 0, {(i, j) for i, j in mines}\n        for i in range(N):\n            for j in range(N):\n                if (i, j) not in mines:\n                    try:\n                        dp[i][j][0] = dp[i - 1][j][0] + 1\n                    except:\n                        dp[i][j][0] = 1\n                    try:\n                        dp[i][j][1] = dp[i][j - 1][1] + 1\n                    except:\n                        dp[i][j][1] = 1\n        for i in range(N - 1, -1, -1):\n            for j in range(N - 1, -1, -1):\n                if (i, j) not in mines:\n                    try:\n                        dp[i][j][2] = dp[i + 1][j][2] + 1\n                    except:\n                        dp[i][j][2] = 1\n                    try:\n                        dp[i][j][3] = dp[i][j + 1][3] + 1\n                    except:\n                        dp[i][j][3] = 1\n                    res = max(res, min(dp[i][j]))\n        return res\n```
[]