✅ ✅   Simple Sort || C++ || T.C O(nlogn)
\nclass Solution {\npublic:\n    int maxArea(int h, int w, vector<int>& hc ,vector<int>& vc) {\n        sort(hc.begin(),hc.end());      //sorting\n        sort(
```\nclass Solution {\npublic:\n    int maxArea(int h, int w, vector<int>& hc ,vector<int>& vc) {\n        sort(hc.begin(),hc.end());      //sorting\n        sort(vc.begin(),vc.end());\n        int height = hc[0];\n        int width = vc[0];\n        \n        \n        for(int i = 0;i<hc.size()-1;i++){\n            \n            height = max(height,hc[i+1]-hc[i]);         //for max height\n        }\n       \n          for(int i = 0;i<vc.size()-1;i++){\n            \n           width = max(width,vc[i+1]-vc[i]);            //for max width\n        }\n        \n        height = max(height,max(hc[0],h-hc[hc.size()-1]));          //checking if height from top or bottom is greater than current height\n        width = max(width,max(vc[0],w-vc[vc.size()-1]));            //checking if width from left or right is greater than current width.\n    \n        \n      return (1LL * height * width) % 1000000007;\n        \n    \n    }\n};\n```
['C', 'Sorting', 'C++']