Add solution #1388

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,272 LeetCode solutions in JavaScript
+# 1,273 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1058,6 +1058,7 @@
 1385|[Find the Distance Value Between Two Arrays](./solutions/1385-find-the-distance-value-between-two-arrays.js)|Easy|
 1386|[Cinema Seat Allocation](./solutions/1386-cinema-seat-allocation.js)|Medium|
 1387|[Sort Integers by The Power Value](./solutions/1387-sort-integers-by-the-power-value.js)|Medium|
+1388|[Pizza With 3n Slices](./solutions/1388-pizza-with-3n-slices.js)|Hard|
 1389|[Create Target Array in the Given Order](./solutions/1389-create-target-array-in-the-given-order.js)|Easy|
 1400|[Construct K Palindrome Strings](./solutions/1400-construct-k-palindrome-strings.js)|Medium|
 1402|[Reducing Dishes](./solutions/1402-reducing-dishes.js)|Hard|

solutions/1388-pizza-with-3n-slices.js

@@ -0,0 +1,41 @@
+/**
+ * 1388. Pizza With 3n Slices
+ * https://leetcode.com/problems/pizza-with-3n-slices/
+ * Difficulty: Hard
+ *
+ * There is a pizza with 3n slices of varying size, you and your friends will take slices
+ * of pizza as follows:
+ * - You will pick any pizza slice.
+ * - Your friend Alice will pick the next slice in the anti-clockwise direction of your pick.
+ * - Your friend Bob will pick the next slice in the clockwise direction of your pick.
+ * - Repeat until there are no more slices of pizzas.
+ *
+ * Given an integer array slices that represent the sizes of the pizza slices in a clockwise
+ * direction, return the maximum possible sum of slice sizes that you can pick.
+ */
+
+/**
+ * @param {number[]} slices
+ * @return {number}
+ */
+var maxSizeSlices = function(slices) {
+  const n = slices.length;
+  const count = n / 3;
+  const case1 = selectMaxSum(slices, count - 1, 2, n - 2);
+  const case2 = selectMaxSum(slices, count, 1, n - 1);
+
+  return Math.max(slices[0] + case1, case2);
+
+  function selectMaxSum(arr, count, start, end, memo = new Map()) {
+    const key = `${count},${start},${end}`;
+    if (count === 0 || start > end) return 0;
+    if (memo.has(key)) return memo.get(key);
+
+    const includeFirst = arr[start] + selectMaxSum(arr, count - 1, start + 2, end, memo);
+    const excludeFirst = selectMaxSum(arr, count, start + 1, end, memo);
+    const result = Math.max(includeFirst, excludeFirst);
+
+    memo.set(key, result);
+    return result;
+  }
+};