add 78, 461, 2044, 2413

Author: rustykitty

0078-subsets.py

@@ -0,0 +1,13 @@
+"""
+78. Subsets
+
+Submitted: January 20, 2025
+
+Runtime: 0 ms (beats 100.00%)
+NenirtL 17.74 MB (beats 53.75%)
+"""
+
+class Solution:
+    def subsets(self, nums: List[int]) -> List[List[int]]:
+        # https://docs.python.org/3/library/itertools.html#itertools-recipes, powerset
+        return list(chain.from_iterable(combinations(nums, r) for r in range(len(nums)+1)))

0461-hamming-distance.cpp

@@ -0,0 +1,26 @@
+/*
+461. Hamming Distance
+
+Submitted; January 20, 2025
+
+Runtime: 0 ms (beats 100.00%)
+Memory: 8.00 MB (beats 5.85%)
+*/
+
+class Solution {
+public:
+    int hammingDistance(int x, int y) {
+        int result = 0;
+        while (x != 0 && y != 0) {
+            if ((x & 1) != (y & 1)) ++result;
+            x >>= 1;
+            y >>= 1;
+        }
+        if (y != 0) swap(x, y);
+        while (x != 0) {
+            result += (x & 1);
+            x >>= 1;
+        }
+        return result;
+    }
+};

2044-count-number-of-maximum-bitwise-or-subsets.py

@@ -0,0 +1,16 @@
+"""
+2044. Count Number of Maximum Bitwise-OR Subsets
+
+Submitted: January 20, 2025
+
+Runtime: 796 MB (beats 23.50%)
+Memory: 17.93 MB (beats 36.21%)
+"""
+
+class Solution:
+    def countMaxOrSubsets(self, nums: List[int]) -> int:
+        # derived from https://docs.python.org/3/library/itertools.html#itertools-recipes, powerset
+        max_or = reduce((lambda x, y: x | y), nums, 0)
+        return sum(
+            reduce((lambda x, y: x | y), it, 0) == max_or for it in chain.from_iterable(combinations(nums, r) for r in range(len(nums)+1))
+        )

2413-smallest-even-multiple.cpp

@@ -0,0 +1,15 @@
+/*
+2413. Smallest Even Multiple
+
+Submitted: January 20, 2925
+
+Runtime: 0 ms (beats 100.00%)
+Memory: 7.91 MB (beats 25.99%)
+*/
+
+class Solution {
+public:
+    int smallestEvenMultiple(int n) {
+        return n & 1 ? n << 1 : n;
+    }
+};