Update count_number_of_one_bits.py

Author: ArunKishoreVoleti

bit_manipulation/count_number_of_one_bits.py

@@ -64,9 +64,10 @@ def get_set_bits_count_using_lookup_table(number: int) -> int:
     """
     Count the number of set bits in a 32-bit integer using a precomputed lookup table.
 
-    Note: I see similar approach in GeeksforGeeks, but their implementation is little different.
-    Link to Code: https://www.geeksforgeeks.org/dsa/count-set-bits-integer-using-lookup-table/
-    
+    Note: I see similar approach in GeeksforGeeks, but the implementation is little different.
+    Link to Code:
+    https://www.geeksforgeeks.org/dsa/count-set-bits-integer-using-lookup-table/
+
     >>> get_set_bits_count_using_lookup_table(25)
     3
     >>> get_set_bits_count_using_lookup_table(37)
@@ -84,17 +85,17 @@ def get_set_bits_count_using_lookup_table(number: int) -> int:
         ...
     ValueError: the value of input must not be negative
     """
-    _LOOKUP_TABLE = [bin(i).count("1") for i in range(256)]
+    _lookup_table = [bin(i).count("1") for i in range(256)]
 
     if number < 0:
         raise ValueError("the value of input must not be negative")
 
     # Split 32-bit number into four 8-bit chunks and use lookup table
     return (
-        _LOOKUP_TABLE[number & 0xFF]
-        + _LOOKUP_TABLE[(number >> 8) & 0xFF]
-        + _LOOKUP_TABLE[(number >> 16) & 0xFF]
-        + _LOOKUP_TABLE[(number >> 24) & 0xFF]
+        _lookup_table[number & 0xFF]
+        + _lookup_table[(number >> 8) & 0xFF]
+        + _lookup_table[(number >> 16) & 0xFF]
+        + _lookup_table[(number >> 24) & 0xFF]
     )