[C++] EASY TO UNDERSTAND || SORTING
TIME COMPLEXITY = 0(NlogN)\n\nclass Solution {\npublic:\n    int maxArea(int h, int w, vector<int>& hCuts, vector<int>& vCuts) {\n        hCuts.push_back(0);\n 
**TIME COMPLEXITY = 0(NlogN)**\n```\nclass Solution {\npublic:\n    int maxArea(int h, int w, vector<int>& hCuts, vector<int>& vCuts) {\n        hCuts.push_back(0);\n        hCuts.push_back(h);\n        \n        vCuts.push_back(0);\n        vCuts.push_back(w);\n        \n        sort(hCuts.begin(), hCuts.end());\n        sort(vCuts.begin(), vCuts.end());\n        \n        int hMax=INT_MIN, vMax = INT_MIN;\n        \n        for(int i=1; i<hCuts.size(); i++){\n            hMax = max(hMax, (hCuts[i]-hCuts[i-1]));\n        }\n        \n        for(int i=1; i<vCuts.size(); i++){\n            vMax = max(vMax, (vCuts[i]-vCuts[i-1]));\n        }\n        \n        return ((long long)hMax*vMax)%1000000007;\n    }\n};\n```\nIf you like the post rhen upvote!!!!!
['C', 'Sorting']