c++ solution easy 😍
class Solution {\npublic:\n    int findMax(vector>& grid , int i ,int j)\n    {\n        int maxi=INT_MIN;\n        for(int x=i ; x<i+3 ; x++){\n            for
class Solution {\npublic:\n    int findMax(vector<vector<int>>& grid , int i ,int j)\n    {\n        int maxi=INT_MIN;\n        for(int x=i ; x<i+3 ; x++){\n            for(int y=j ; y<j+3 ; y++)\n                maxi=max(maxi , grid[x][y]);\n        }\n        return maxi;\n    }\n    \n    \n    \n    \n    vector<vector<int>> largestLocal(vector<vector<int>>& grid) {\n        int n=grid.size();\n        \n        vector<vector<int>> v(n-2 , vector<int> (n-2));\n        for(int i=0 ; i<n-2 ; i++)\n        {\n            for(int j=0 ; j<n-2 ; j++)\n                v[i][j] = findMax(grid , i , j);\n            \n        }\n            \n        return v;\n    }\n};
['C']