Java Solution 16 ms, faster than 98.49%
\npublic int maxArea(int h, int w, int[] horizontalCuts, int[] verticalCuts) {\n        Arrays.sort(horizontalCuts);\n        Arrays.sort(verticalCuts);\n      
```\npublic int maxArea(int h, int w, int[] horizontalCuts, int[] verticalCuts) {\n        Arrays.sort(horizontalCuts);\n        Arrays.sort(verticalCuts);\n        int mod = (int) 1e9 + 7;\n        \n        int nh = horizontalCuts.length;\n        int nw = verticalCuts.length;\n        \n        long max_h = horizontalCuts[0];\n        long max_w = verticalCuts[0];\n        \n        for(int i=1;i<nh;i++)\n            max_h = Math.max(horizontalCuts[i] - horizontalCuts[i-1],max_h);\n         \n        for(int i=1;i<nw;i++)\n            max_w = Math.max(verticalCuts[i] - verticalCuts[i-1], max_w);\n        max_h = Math.max(h-horizontalCuts[nh-1], max_h);\n        max_w = Math.max(w-verticalCuts[nw-1],max_w);\n\n        return (int)((max_h*max_w) % mod);\n    }\n```
['Greedy', 'Sorting', 'Java']