Add solution #368

Author: JoshCrozier

README.md

@@ -289,6 +289,7 @@
 363|[Max Sum of Rectangle No Larger Than K](./0363-max-sum-of-rectangle-no-larger-than-k.js)|Hard|
 365|[Water and Jug Problem](./0365-water-and-jug-problem.js)|Medium|
 367|[Valid Perfect Square](./0367-valid-perfect-square.js)|Easy|
+368|[Largest Divisible Subset](./0368-largest-divisible-subset.js)|Medium|
 371|[Sum of Two Integers](./0371-sum-of-two-integers.js)|Medium|
 372|[Super Pow](./0372-super-pow.js)|Medium|
 374|[Guess Number Higher or Lower](./0374-guess-number-higher-or-lower.js)|Medium|

solutions/0368-largest-divisible-subset.js

@@ -0,0 +1,36 @@
+/**
+ * 368. Largest Divisible Subset
+ * https://leetcode.com/problems/largest-divisible-subset/
+ * Difficulty: Medium
+ *
+ * Given a set of distinct positive integers nums, return the largest subset answer such that
+ * every pair (answer[i], answer[j]) of elements in this subset satisfies:
+ * - answer[i] % answer[j] == 0, or
+ * - answer[j] % answer[i] == 0
+ *
+ * If there are multiple solutions, return any of them.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var largestDivisibleSubset = function(nums) {
+  nums.sort((a, b) => a - b);
+  const dp = nums.map(() => [1, -1]);
+  let max = 0;
+  for (let i = 1; i < nums.length; i++) {
+    for (let j = 0; j < i; j++) {
+      if (nums[i] % nums[j] === 0 && dp[j][0] + 1 > dp[i][0]) {
+        dp[i] = [dp[j][0] + 1, j], dp[i][0] > dp[max][0] && (max = i);
+      }
+    }
+  }
+
+  const result = [];
+  for (let i = max; i >= 0; i = dp[i][1]) {
+    result.unshift(nums[i]);
+  }
+
+  return result;
+};