C++ Easy and simple solution
Guy\'s if you find this solution helpful \uD83D\uDE0A, PLEASE do UPVOTE. By doing that it motivate\'s me to create more better post like this \u270D\uFE0F\n\nin
***Guy\'s if you find this solution helpful \uD83D\uDE0A, PLEASE do UPVOTE. By doing that it motivate\'s me to create more better post like this \u270D\uFE0F***\n```\nint getMax(vector<vector<int>>&grid, int i,int j){\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(grid[x][y],maxi);\n            }\n        }\n        return maxi;\n    }\n    \n    vector<vector<int>> largestLocal(vector<vector<int>>& grid) {\n        int n=grid.size();\n        int m=n-2;\n        vector<vector<int>>ans(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                ans[i][j]=getMax(grid,i,j);\n            }\n        }\n        return ans;\n    }\n```\n***Guy\'s if you find this solution helpful \uD83D\uDE0A, PLEASE do UPVOTE. By doing that it motivate\'s me to create more better post like this \u270D\uFE0F***
['C', 'C++']