[Python] Easy Solution | Beat 98%
\n# Code\n\nclass Solution:\n    def largestLocal(self, grid: List[List[int]]) -> List[List[int]]:\n        n = len(grid)\n        result = []\n        \n      
\n# Code\n```\nclass Solution:\n    def largestLocal(self, grid: List[List[int]]) -> List[List[int]]:\n        n = len(grid)\n        result = []\n        \n        for i in range(1, n - 1):  # Skip the first and last rows\n            row_result = []\n            for j in range(1, n - 1):  # Skip the first and last columns\n                max_value = max(\n                    grid[i - 1][j - 1], grid[i - 1][j], grid[i - 1][j + 1],\n                    grid[i][j - 1], grid[i][j], grid[i][j + 1],\n                    grid[i + 1][j - 1], grid[i + 1][j], grid[i + 1][j + 1]\n                )\n                row_result.append(max_value)\n            result.append(row_result)\n        \n        return result\n```
['Python3']