Jul 28

Author: siddydutta

2025-07-July-LeetCoding-Challenge/Count Number of Maximum Bitwise-OR Subsets.py

@@ -0,0 +1,33 @@
+class Solution:
+    def countMaxOrSubsets(self, nums: list[int]) -> int:
+        m_or = 0
+        for num in nums:
+            m_or |= num
+        result = 0
+
+        def dfs(idx: int, curr_or: int) -> None:
+            if idx == len(nums):
+                if m_or == curr_or:
+                    nonlocal result
+                    result += 1
+                return
+            dfs(idx + 1, curr_or | nums[idx])
+            dfs(idx + 1, curr_or)
+
+        dfs(0, 0)
+        return result
+
+
+def main():
+    nums = [3, 1]
+    assert Solution().countMaxOrSubsets(nums) == 2
+
+    nums = [2, 2, 2]
+    assert Solution().countMaxOrSubsets(nums) == 7
+
+    nums = [3, 2, 1, 5]
+    assert Solution().countMaxOrSubsets(nums) == 6
+
+
+if __name__ == '__main__':
+    main()

2025-07-July-LeetCoding-Challenge/README.md

@@ -31,7 +31,7 @@
 | July 25 | [3487. Maximum Unique Subarray Sum After Deletion](https://leetcode.com/problems/maximum-unique-subarray-sum-after-deletion/) | Easy | Solved |
 | July 26 | [3480. Maximize Subarrays After Removing One Conflicting Pair](https://leetcode.com/problems/maximize-subarrays-after-removing-one-conflicting-pair/) | Hard | Unsolved |
 | July 27 | [2210. Count Hills and Valleys in an Array](https://leetcode.com/problems/count-hills-and-valleys-in-an-array/) | Easy | Solved |
-| July 28 | []() |  |  |
+| July 28 | [2044. Count Number of Maximum Bitwise-OR Subsets](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets/) | Medium | Solved |
 | July 29 | []() |  |  |
 | July 30 | []() |  |  |
 | July 31 | []() |  |  |
@@ -41,5 +41,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 7 | 7 | 0 |
-| Medium | 10 | 9 | 1 |
+| Medium | 11 | 10 | 1 |
 | Hard   | 9 | 1 | 8 |