Added Leetcode 201

Author: gahogg

Bitwise AND of Numbers Range - Leetcode 201/Bitwise AND of Numbers Range - Leetcode 201.cpp

@@ -0,0 +1,16 @@
+class Solution {
+public:
+    int rangeBitwiseAnd(int m, int n) {
+        int shift = 0;
+
+        // Shift both numbers to the right until they are equal
+        while (m < n) {
+            m >>= 1;
+            n >>= 1;
+            shift++;
+        }
+
+        // Shift the common prefix back to its original position
+        return m << shift;
+    }
+};

Bitwise AND of Numbers Range - Leetcode 201/Bitwise AND of Numbers Range - Leetcode 201.java

@@ -0,0 +1,15 @@
+public class Solution {
+    public int rangeBitwiseAnd(int m, int n) {
+        int shift = 0;
+
+        // Shift both numbers to the right until they are equal
+        while (m < n) {
+            m >>= 1;
+            n >>= 1;
+            shift++;
+        }
+
+        // Shift the common prefix back to its original position
+        return m << shift;
+    }
+}

Bitwise AND of Numbers Range - Leetcode 201/Bitwise AND of Numbers Range - Leetcode 201.js

@@ -0,0 +1,13 @@
+var rangeBitwiseAnd = function(m, n) {
+    let shift = 0;
+
+    // Shift both numbers to the right until they are equal
+    while (m < n) {
+        m >>= 1;
+        n >>= 1;
+        shift++;
+    }
+
+    // Shift the common prefix back to its original position
+    return m << shift;
+};

Bitwise AND of Numbers Range - Leetcode 201/Bitwise AND of Numbers Range - Leetcode 201.py

@@ -0,0 +1,12 @@
+class Solution:
+    def rangeBitwiseAnd(self, m: int, n: int) -> int:
+        shift = 0
+        
+        while m < n:
+            m = m >> 1
+            n = n >> 1
+            shift += 1
+
+        return m << shift
+        # Time: O(Bits)
+        # Space: O(1)