Apr 06

Author: siddydutta

2025-04-April-LeetCoding-Challenge/Largest Divisible Subset.py

@@ -0,0 +1,34 @@
+class Solution:
+    def largestDivisibleSubset(self, nums: list[int]) -> list[int]:
+        n = len(nums)
+        count, previous = [0] * n, [0] * n
+        nums.sort()
+
+        max_count, index = 0, -1
+        for i in range(n):
+            count[i], previous[i] = 1, -1
+            for j in range(i-1, -1, -1):
+                if nums[i] % nums[j] == 0 and count[j] + 1 > count[i]:
+                    count[i] = count[j] + 1
+                    previous[i] = j
+            if count[i] > max_count:
+                max_count = count[i]
+                index = i
+
+        subset = []
+        while index != -1:
+            subset.append(nums[index])
+            index = previous[index]
+        return subset
+
+
+def main():
+    nums = [1, 2, 3]
+    assert Solution().largestDivisibleSubset(nums) == [2, 1]
+
+    nums = [1, 2, 4, 8]
+    assert Solution().largestDivisibleSubset(nums) == [8, 4, 2, 1]
+
+
+if __name__ == '__main__':
+    main()

2025-04-April-LeetCoding-Challenge/README.md

@@ -8,8 +8,8 @@
 | April 02 | [2873. Maximum Value of an Ordered Triplet I](https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-i/) | Easy | Solved |
 | April 03 | [2874. Maximum Value of an Ordered Triplet II](https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-ii/) | Medium | Solved |
 | April 04 | [1123. Lowest Common Ancestor of Deepest Leaves](https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/) | Medium | Solved |
-| April 05 | []() |  |  |
-| April 06 | []() |  |  |
+| April 05 | [1863. Sum of All Subset XOR Totals](https://leetcode.com/problems/sum-of-all-subset-xor-totals/) | Easy | Solved |
+| April 06 | [368. Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/) | Medium | Unsolved |
 | April 07 | []() |  |  |
 | April 08 | []() |  |  |
 | April 09 | []() |  |  |
@@ -39,6 +39,6 @@
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
-| Easy   | 1 | 1 | 0 |
-| Medium | 3 | 3 | 0 |
+| Easy   | 2 | 2 | 0 |
+| Medium | 4 | 3 | 1 |
 | Hard   | 0 | 0 | 0 |

2025-04-April-LeetCoding-Challenge/Sum of All Subset XOR Totals.py

@@ -0,0 +1,21 @@
+class Solution:
+    def subsetXORSum(self, nums: list[int]) -> int:
+        or_sum = 0
+        for num in nums:
+            or_sum |= num
+        return or_sum * (1 << (len(nums) - 1))
+
+
+def main():
+    nums = [1, 3]
+    assert Solution().subsetXORSum(nums) == 6
+
+    nums = [5, 1, 6]
+    assert Solution().subsetXORSum(nums) == 28
+
+    nums = [3, 4, 5, 6, 7, 8]
+    assert Solution().subsetXORSum(nums) == 480
+
+
+if __name__ == '__main__':
+    main()