Add solution #2429

Author: JoshCrozier

2429-minimize-xor.js

@@ -0,0 +1,37 @@
+/**
+ * 2429. Minimize XOR
+ * https://leetcode.com/problems/minimize-xor/
+ * Difficulty: Medium
+ *
+ * Given two positive integers num1 and num2, find the positive integer x such that:
+ * - x has the same number of set bits as num2, and
+ * - The value x XOR num1 is minimal.
+ *
+ * Note that XOR is the bitwise XOR operation.
+ *
+ * Return the integer x. The test cases are generated such that x is uniquely determined.
+ *
+ * The number of set bits of an integer is the number of 1's in its binary representation.
+ */
+
+/**
+ * @param {number} num1
+ * @param {number} num2
+ * @return {number}
+ */
+var minimizeXor = function(num1, num2) {
+  let count1 = num1.toString(2).split('1').length - 1;
+  const count2 = num2.toString(2).split('1').length - 1;
+
+  while (count1 > count2) {
+    num1 &= (num1 - 1);
+    count1--;
+  }
+
+  while (count1 < count2) {
+    num1 |= (num1 + 1);
+    count1++;
+  }
+
+  return num1;
+};

README.md

@@ -412,6 +412,7 @@
 2396|[Strictly Palindromic Number](./2396-strictly-palindromic-number.js)|Medium|
 2413|[Smallest Even Multiple](./2413-smallest-even-multiple.js)|Easy|
 2427|[Number of Common Factors](./2427-number-of-common-factors.js)|Easy|
+2429|[Minimize XOR](./2429-minimize-xor.js)|Medium|
 2469|[Convert the Temperature](./2469-convert-the-temperature.js)|Easy|
 2482|[Difference Between Ones and Zeros in Row and Column](./2482-difference-between-ones-and-zeros-in-row-and-column.js)|Medium|
 2490|[Circular Sentence](./2490-circular-sentence.js)|Easy|