Add solution #241

Author: JoshCrozier

README.md

@@ -222,6 +222,7 @@
 238|[Product of Array Except Self](./0238-product-of-array-except-self.js)|Medium|
 239|[Sliding Window Maximum](./0239-sliding-window-maximum.js)|Hard|
 240|[Search a 2D Matrix II](./0240-search-a-2d-matrix-ii.js)|Medium|
+241|[Different Ways to Add Parentheses](./0241-different-ways-to-add-parentheses.js)|Medium|
 242|[Valid Anagram](./0242-valid-anagram.js)|Easy|
 257|[Binary Tree Paths](./0257-binary-tree-paths.js)|Easy|
 258|[Add Digits](./0258-add-digits.js)|Easy|

solutions/0241-different-ways-to-add-parentheses.js

@@ -0,0 +1,31 @@
+/**
+ * 241. Different Ways to Add Parentheses
+ * https://leetcode.com/problems/different-ways-to-add-parentheses/
+ * Difficulty: Medium
+ *
+ * Given a string expression of numbers and operators, return all possible results from
+ * computing all the different possible ways to group numbers and operators. You may
+ * return the answer in any order.
+ *
+ * The test cases are generated such that the output values fit in a 32-bit integer and
+ * the number of different results does not exceed 104.
+ */
+
+/**
+ * @param {string} expression
+ * @return {number[]}
+ */
+var diffWaysToCompute = function(expression) {
+  const results = [];
+
+  for (let i = 0; i < expression.length; i++) {
+    if ('+-*'.includes(expression[i])) {
+      const left = diffWaysToCompute(expression.slice(0, i));
+      const right = diffWaysToCompute(expression.slice(i + 1));
+      left.forEach(l => right.forEach(r =>
+        results.push(expression[i] === '+' ? l + r : expression[i] === '-' ? l - r : l * r)));
+    }
+  }
+
+  return results.length ? results : [+expression];
+};