Python || DP
Just keep a check of nos of consecutive 1s in left and top in first loop\nRight and down in second loop,and take min of all 4 directions,thats it !!!!\n\nclass 
Just keep a check of nos of consecutive 1s in left and top in first loop\nRight and down in second loop,and take min of all 4 directions,thats it !!!!\n```\nclass Solution:\n    def orderOfLargestPlusSign(self, n: int, mines: List[List[int]]) -> int:\n        m=len(mines)\n        if m==n*n: return 0\n        seen=set()\n        for i,j in mines:\n            seen.add((i,j))\n        ans=1\n        #(left,up,right,down)\n        dp=[[[0,0,0,0] for _ in range(n)] for _ in range(n)]\n        for i in range(n):\n            for j in range(n):\n                if (i,j) not in seen:\n                    dp[i][j][0]=(dp[i][j-1][0]+1) if j-1>=0 else 1\n                    dp[i][j][1]=(dp[i-1][j][1]+1) if i-1>=0 else 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 seen:\n                    dp[i][j][2]=(dp[i][j+1][2]+1) if j+1<n else 1\n                    dp[i][j][3]=(dp[i+1][j][3]+1) if i+1<n else 1\n                ans=max(ans,min(dp[i][j]))\n        return ans\n                    \n\n\n```
['Dynamic Programming', 'Python']