Add solution #1465

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,315 LeetCode solutions in JavaScript
+# 1,316 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1120,6 +1120,7 @@
 1462|[Course Schedule IV](./solutions/1462-course-schedule-iv.js)|Medium|
 1463|[Cherry Pickup II](./solutions/1463-cherry-pickup-ii.js)|Hard|
 1464|[Maximum Product of Two Elements in an Array](./solutions/1464-maximum-product-of-two-elements-in-an-array.js)|Easy|
+1465|[Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts](./solutions/1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts.js)|Medium|
 1466|[Reorder Routes to Make All Paths Lead to the City Zero](./solutions/1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero.js)|Medium|
 1470|[Shuffle the Array](./solutions/1470-shuffle-the-array.js)|Easy|
 1472|[Design Browser History](./solutions/1472-design-browser-history.js)|Medium|

solutions/1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts.js

@@ -0,0 +1,39 @@
+/**
+ * 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts
+ * https://leetcode.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/
+ * Difficulty: Medium
+ *
+ * You are given a rectangular cake of size h x w and two arrays of integers horizontalCuts and
+ * verticalCuts where:
+ * - horizontalCuts[i] is the distance from the top of the rectangular cake to the ith horizontal
+ *   cut and similarly, and
+ * - verticalCuts[j] is the distance from the left of the rectangular cake to the jth vertical cut.
+ *
+ * Return the maximum area of a piece of cake after you cut at each horizontal and vertical position
+ * provided in the arrays horizontalCuts and verticalCuts. Since the answer can be a large number,
+ * return this modulo 109 + 7.
+ */
+
+/**
+ * @param {number} h
+ * @param {number} w
+ * @param {number[]} horizontalCuts
+ * @param {number[]} verticalCuts
+ * @return {number}
+ */
+var maxArea = function(h, w, horizontalCuts, verticalCuts) {
+  horizontalCuts.sort((a, b) => a - b);
+  verticalCuts.sort((a, b) => a - b);
+
+  let maxHeight = Math.max(horizontalCuts[0], h - horizontalCuts[horizontalCuts.length - 1]);
+  let maxWidth = Math.max(verticalCuts[0], w - verticalCuts[verticalCuts.length - 1]);
+
+  for (let i = 1; i < horizontalCuts.length; i++) {
+    maxHeight = Math.max(maxHeight, horizontalCuts[i] - horizontalCuts[i - 1]);
+  }
+  for (let i = 1; i < verticalCuts.length; i++) {
+    maxWidth = Math.max(maxWidth, verticalCuts[i] - verticalCuts[i - 1]);
+  }
+
+  return Number((BigInt(maxHeight) * BigInt(maxWidth)) % BigInt(1000000007));
+};