Beating 98% of the CPP solutions !
class Solution {\npublic:\n    int maxArea(int h, int w, vector& v1, vector& v2) {\n        const long long MOD = 1e9 + 7;\n        v1.push_back(0),v1.push_back
class Solution {\npublic:\n    int maxArea(int h, int w, vector<int>& v1, vector<int>& v2) {\n        const long long MOD = 1e9 + 7;\n        v1.push_back(0),v1.push_back(h);\n        v2.push_back(0),v2.push_back(w);\n        \n   //Sorting to find the maximum adjacent difference\n        long long diffa=0,diffb=0;\n        sort(v1.begin(),v1.end());\n        sort(v2.begin(),v2.end());\n        \n   //Finding maximum Adjacent difference \n        for(int i=1;i<v1.size();i++){\n            if(v1[i]-v1[i-1]>diffa) diffa = v1[i]-v1[i-1];\n        }\n        for(int i=1;i<v2.size();i++){\n            if(v2[i]-v2[i-1]>diffb) diffb = v2[i]-v2[i-1];\n        }\n        \n        return (diffa*diffb)%MOD;\n    }\n};
['C']