✅[C++] Solution | Easy to understand clean solution
\nclass Solution {\npublic:\n    int maxArea(int h, int w, vector<int>& horizontalCuts, vector<int>& verticalCuts) {\n        sort(horizontalCuts.begin(), horiz
```\nclass Solution {\npublic:\n    int maxArea(int h, int w, vector<int>& horizontalCuts, vector<int>& verticalCuts) {\n        sort(horizontalCuts.begin(), horizontalCuts.end());\n        sort(verticalCuts.begin(), verticalCuts.end());\n        \n        int maxH=horizontalCuts[0], maxW=verticalCuts[0];\n\n        horizontalCuts.push_back(h);\n        verticalCuts.push_back(w);\n        \n        for(int i=1; i<horizontalCuts.size(); i++){\n            maxH = max(maxH, horizontalCuts[i]-horizontalCuts[i-1]);\n        }\n        \n        for(int i=1; i<verticalCuts.size(); i++){\n            maxW = max(maxW, verticalCuts[i]-verticalCuts[i-1]);\n        }\n        \n        return (int)((long)maxH*maxW % (1000000007));\n    }\n};\n```
['C', 'C++']