Add solution #312

Author: JoshCrozier

0312-burst-balloons.js

@@ -0,0 +1,37 @@
+/**
+ * 312. Burst Balloons
+ * https://leetcode.com/problems/burst-balloons/
+ * Difficulty: Hard
+ *
+ * You are given n balloons, indexed from 0 to n - 1. Each balloon is painted with a number
+ * on it represented by an array nums. You are asked to burst all the balloons.
+ *
+ * If you burst the ith balloon, you will get nums[i - 1] * nums[i] * nums[i + 1] coins.
+ * If i - 1 or i + 1 goes out of bounds of the array, then treat it as if there is a
+ * balloon with a 1 painted on it.
+ *
+ * Return the maximum coins you can collect by bursting the balloons wisely.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maxCoins = function(nums) {
+  const track = [1, ...nums, 1];
+  const dp = new Array(nums.length + 2).fill().map(() => new Array(nums.length + 2).fill(0));
+
+  for (let count = 1; count <= nums.length; count++) {
+    for (let i = 1; i <= nums.length - count + 1; i++) {
+      const j = i + count - 1;
+      for (let k = i; k <= j; k++) {
+        dp[i - 1][j + 1] = Math.max(
+          dp[i - 1][j + 1],
+          dp[i - 1][k] + dp[k][j + 1] + track[i - 1] * track[k] * track[j + 1]
+        );
+      }
+    }
+  }
+
+  return dp[0][nums.length + 1];
+};

README.md

@@ -253,6 +253,7 @@
 307|[Range Sum Query - Mutable](./0307-range-sum-query-mutable.js)|Medium|
 309|[Best Time to Buy and Sell Stock with Cooldown](./0309-best-time-to-buy-and-sell-stock-with-cooldown.js)|Medium|
 310|[Minimum Height Trees](./0310-minimum-height-trees.js)|Medium|
+312|[Burst Balloons](./0312-burst-balloons.js)|Hard|
 315|[Count of Smaller Numbers After Self](./0315-count-of-smaller-numbers-after-self.js)|Hard|
 316|[Remove Duplicate Letters](./0316-remove-duplicate-letters.js)|Medium|
 318|[Maximum Product of Word Lengths](./0318-maximum-product-of-word-lengths.js)|Medium|