Sync LeetCode submission Runtime - 131 ms (98.87%), Memory - 18.8 MB (17.14%)

Author: jimit105

0368-largest-divisible-subset/README.md

@@ -0,0 +1,33 @@
+<p>Given a set of <strong>distinct</strong> positive integers <code>nums</code>, return the largest subset <code>answer</code> such that every pair <code>(answer[i], answer[j])</code> of elements in this subset satisfies:</p>
+
+<ul>
+	<li><code>answer[i] % answer[j] == 0</code>, or</li>
+	<li><code>answer[j] % answer[i] == 0</code></li>
+</ul>
+
+<p>If there are multiple solutions, return any of them.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,2,3]
+<strong>Output:</strong> [1,2]
+<strong>Explanation:</strong> [1,3] is also accepted.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,2,4,8]
+<strong>Output:</strong> [1,2,4,8]
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 1000</code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 2 * 10<sup>9</sup></code></li>
+	<li>All the integers in <code>nums</code> are <strong>unique</strong>.</li>
+</ul>

0368-largest-divisible-subset/solution.py

@@ -0,0 +1,14 @@
+# Approach 1: Dynamic Programming
+
+# Time: O(n^2)
+# Space: O(n^2)
+
+class Solution:
+    def largestDivisibleSubset(self, nums: List[int]) -> List[int]:
+        subsets = {-1: set()}
+
+        for num in sorted(nums):
+            subsets[num] = max([subsets[k] for k in subsets if num % k == 0], key = len) | {num}
+
+        return list(max(subsets.values(), key=len))
+