Day5 - Mock Coding Interview Series - Bit Manipulation

Complete series at https://bit.ly/MockInterviewSeries

Author: rachitiitr

LeetCode/476.number-complement.cpp

@@ -0,0 +1,9 @@
+class Solution {
+public:
+    int bitwiseComplement(int n) {
+        if(n == 0) return 1;
+        int numberOfBits = log2(n) + 1; // 100 log10(100) => 2+1 => 3
+        int mask = (1 << numberOfBits) - 1; // pow(2, numberOfBits)
+        return mask ^ n;
+    }
+};