Python | Simple Solution
\nclass Solution:\n    def orderOfLargestPlusSign(self, n: int, mines: List[List[int]]) -> int:\n        lookup = [[0 for _ in range(n)] for _ in range(n)]\n\n 
```\nclass Solution:\n    def orderOfLargestPlusSign(self, n: int, mines: List[List[int]]) -> int:\n        lookup = [[0 for _ in range(n)] for _ in range(n)]\n\n        grid = [[1 for _ in range(n)] for _ in range(n)]\n        for x, y in mines:\n            grid[x][y] = 0\n\n        largestPlusSignOrder = 0\n\n        # Iterate forward then backward\n        for x in range(n):\n            plusSign = 0\n            for y in range(n):\n                if grid[x][y] == 1:\n                    plusSign += 1\n                else:\n                    plusSign = 0\n                lookup[x][y] = plusSign\n            plusSign = 0\n            for y in range(n - 1, -1, -1):\n                if grid[x][y] == 1:\n                    plusSign += 1\n                else:\n                    plusSign = 0\n                lookup[x][y] = min(lookup[x][y], plusSign)\n\n        # Iterate downward then upward\n        for y in range(n):\n            plusSign = 0\n            for x in range(n):\n                if grid[x][y] == 1:\n                    plusSign += 1\n                else:\n                    plusSign = 0\n                lookup[x][y] = min(lookup[x][y], plusSign)\n            plusSign = 0\n            for x in range(n - 1, -1, -1):\n                if grid[x][y] == 1:\n                    plusSign += 1\n                else:\n                    plusSign = 0\n                lookup[x][y] = min(lookup[x][y], plusSign)\n                largestPlusSignOrder = max(largestPlusSignOrder, lookup[x][y])\n\n        return largestPlusSignOrder\n```\n\n***If you liked the above solution then please upvote!***
[]