🔥🔥Brute force for beginners (very easy solution) C++🔥🔥
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. By using nested for loops
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->By using nested for loops\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    vector<vector<int>> largestLocal(vector<vector<int>>& grid) {\n        \n        int n = grid.size();\n\n        vector<vector<int>> v(n-2 , vector<int>(n-2));\n\n        for(int i = 0 ; i < n-2 ; i++)\n        {\n            for(int j = 0 ; j < n-2 ; j++)\n            {\n                int ans = INT_MIN;\n                for(int x = i ; x < i+3 ; x++)\n                {\n                    for(int y = j ; y < j+3 ; y++)\n                    {\n                        ans = max(grid[x][y] , ans);\n                    }\n                }\n                v[i][j] = ans;\n            }\n        }\n        return v;\n    }\n};\n```
['C++']