C++ || Simple Code || Faster Than 99%
\n****class Solution {\npublic:\n    int maxArea(int h, int w, vector<int>& hori, vector<int>& verti) {\n        sort(hori.begin(),hori.end());\n        sort(ve
```\n****class Solution {\npublic:\n    int maxArea(int h, int w, vector<int>& hori, vector<int>& verti) {\n        sort(hori.begin(),hori.end());\n        sort(verti.begin(),verti.end());\n        int n = hori.size(),m=verti.size();\n        int ans1 = 0;\n        int ans2 = 0;\n        for(int i=0;i<n-1;++i){\n            ans1 = max(ans1,hori[i+1]-hori[i]);\n        }\n        for(int i=0;i<m-1;++i){\n            ans2 = max(ans2,verti[i+1]-verti[i]);\n        }\n        ans2 = max(ans2,w - verti[m-1]);\n        ans1 = max(ans1,h - hori[n-1]);\n        ans2 = max(ans2,verti[0] - 0);\n        ans1 = max(ans1,hori[0] - 0);\n        long long int mod = (1e9 + 7);\n        return  ((ans1 % mod) * (ans2 % mod)) % mod;\n        \n    }\n};\n```**
[]