📌 c++ solution ✔
\nclass Solution {\npublic:\n    int find(int i,int j,vector<vector<int>>& grid){\n        int ans= 0;\n        \n        for(int ii=0;ii<3;ii++)\n            f
```\nclass Solution {\npublic:\n    int find(int i,int j,vector<vector<int>>& grid){\n        int ans= 0;\n        \n        for(int ii=0;ii<3;ii++)\n            for(int jj=0;jj<3;jj++)\n                ans= max(ans, grid[i+ii][j+jj]);\n        \n        return ans;\n    }\n//----------------------------------------------------------------------\n    vector<vector<int>> largestLocal(vector<vector<int>>& grid) {\n        int ln= grid.size();\n        vector<vector<int>> ans(ln-2,vector<int>(ln-2));\n        \n        for(int i=0;(i+3)<= ln;i++)\n            for(int j=0;(j+3)<= ln;j++)\n                ans[i][j]= find(i,j,grid);\n        \n        return ans;\n    }\n};\n```
['C', 'C++']