Single Number 3

Author: nlohia-godaddy

src/main/java/leetcode/medium/SingleNumberIII.java

@@ -0,0 +1,31 @@
+package leetcode.medium;
+
+public class SingleNumberIII {
+
+    int[] singleNumberIII(int[] nums) {
+
+        int xored = 0;
+        for (int num : nums)
+            xored ^= num;
+
+        // Find exclusive bit
+        int exbit = 0;
+        while (true) {
+            if ((xored & 1) == 1)
+                break;
+            xored = xored >> 1;
+            exbit++;
+        }
+
+        int setBucket = 0;
+        int unsetBucket = 0;
+        for (int num : nums)
+            // If the bit is set, move to set bucket
+            if (((num >> exbit) & 1) == 1)
+                setBucket ^= num;
+            else
+                unsetBucket ^= num;
+
+        return new int[]{setBucket, unsetBucket};
+    }
+}

src/test/java/leetcode/medium/SingleNumberIIITest.java

@@ -0,0 +1,41 @@
+package leetcode.medium;
+
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.*;
+
+class SingleNumberIIITest {
+
+    private final SingleNumberIII singleNumberIII;
+
+    SingleNumberIIITest() {
+        singleNumberIII = new SingleNumberIII();
+    }
+
+    @Test
+    void testSingleNumberIII1() {
+        int[] nums = {2, 2, 3, 6, 3, 4, 12, 4};
+        int[] expected = {6, 12};
+        int[] result = singleNumberIII.singleNumberIII(nums);
+
+        assertArrayEquals(expected, result);
+    }
+
+    @Test
+    void testSingleNumberIII2() {
+        int[] nums = {-1, 0};
+        int[] expected = {-1, 0};
+        int[] result = singleNumberIII.singleNumberIII(nums);
+
+        assertArrayEquals(expected, result);
+    }
+
+    @Test
+    void testSingleNumberIII3() {
+        int[] nums = {0, 1};
+        int[] expected = {1, 0};
+        int[] result = singleNumberIII.singleNumberIII(nums);
+
+        assertArrayEquals(expected, result);
+    }
+}