my_getMaxOfV
 # Intuition  \n\n\n\n\n\n\n\n\n\n\n\n# Code\n\nint getMaxOfV(vector<vector<int>> &v) {\n  int max(0);\n  for (auto &&line : v) {\n    for (auto &&elem : line) 
<!-- # Intuition -->\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n<!-- # Approach -->\n<!-- Describe your approach to solving the problem. -->\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```\nint getMaxOfV(vector<vector<int>> &v) {\n  int max(0);\n  for (auto &&line : v) {\n    for (auto &&elem : line) {\n      if (elem > max) max = elem;\n    }\n  }\n  return max;\n}\n\nclass Solution {\n public:\n  vector<vector<int>> largestLocal(vector<vector<int>> &grid) {\n    size_t size = grid.size();\n    vector<vector<int>> result = {};\n\n    for (size_t startRow = 0; startRow <= size - 3; startRow++) {\n      vector<int> tempV = {};\n      for (size_t startCol = 0; startCol <= size - 3; startCol++) {\n        vector<vector<int>> largeV = {};\n        for (size_t row = startRow; row < startRow + 3; row++) {\n          vector<int> smallV(grid[row].begin() + startCol,\n                             grid[row].begin() + startCol + 3);\n          largeV.push_back(smallV);\n        }\n        tempV.push_back(getMaxOfV(largeV));\n      }\n      result.push_back(tempV);\n    }\n\n    return result;\n  }\n};\n```
['C++']