[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

bit_manipulation/index_of_rightmost_set_bit.py

@@ -1,20 +1,21 @@
 # Reference: https://www.geeksforgeeks.org/position-of-rightmost-set-bit/
 
+
 def get_index_of_rightmost_set_bit(number: int) -> int:
     """
     Take in a positive integer 'number'.
     Returns the zero-based index of first set bit in that 'number' from right.
     Returns -1, If no set bit found.
 
-    >>> get_index_of_rightmost_set_bit(0) 
+    >>> get_index_of_rightmost_set_bit(0)
     -1
-    >>> get_index_of_rightmost_set_bit(5) 
+    >>> get_index_of_rightmost_set_bit(5)
     0
-    >>> get_index_of_rightmost_set_bit(36) 
+    >>> get_index_of_rightmost_set_bit(36)
     2
-    >>> get_index_of_rightmost_set_bit(8)  
+    >>> get_index_of_rightmost_set_bit(8)
     3
-    >>> get_index_of_rightmost_set_bit(-18) 
+    >>> get_index_of_rightmost_set_bit(-18)
     Traceback (most recent call last):
         ...
     ValueError: Input must be a non-negative integer
@@ -23,12 +24,13 @@ def get_index_of_rightmost_set_bit(number: int) -> int:
     if 0 > number and not isinstance(number, int):
         raise ValueError("Input must be a non-negative integer")
 
-    intermediate = number&~(number-1)
+    intermediate = number & ~(number - 1)
     index = 0
     while intermediate:
-        intermediate>>=1
-        index+=1
-    return index-1
+        intermediate >>= 1
+        index += 1
+    return index - 1
+
 
 if __name__ == "__main__":
     """