✅Python || Easy Approach || Brute force
\nclass Solution:\n    def largestLocal(self, grid: List[List[int]]) -> List[List[int]]:\n\n        n = len(grid)\n        ans = []\n\n        for i in range(n 
```\nclass Solution:\n    def largestLocal(self, grid: List[List[int]]) -> List[List[int]]:\n\n        n = len(grid)\n        ans = []\n\n        for i in range(n - 2):\n            res = []\n\n            for j in range(n - 2):\n                k = []\n                k.append(grid[i][j])\n                k.append(grid[i][j + 1])\n                k.append(grid[i][j + 2])\n                k.append(grid[i + 1][j])\n                k.append(grid[i + 1][j + 1])\n                k.append(grid[i + 1][j + 2])\n                k.append(grid[i + 2][j])\n                k.append(grid[i + 2][j + 1])\n                k.append(grid[i + 2][j + 2])\n                m = max(k)\n                res.append(m)\n\n            ans.append(res)\n        \n        return ans\n```
['Python', 'Python3']