@@ -0,0 +1,850 @@
+def get_highest_set_bit_position(number: int) -%3E int:%0A    %22%22%22%0A    Returns position of the highest set bit of a number.%0A    Ref - https://graphics.stanford.edu/~seander/bithacks.html#IntegerLogObvious%0A    %3E%3E%3E get_highest_set_bit_position(25)%0A    5%0A    %3E%3E%3E get_highest_set_bit_position(37)%0A    6%0A    %3E%3E%3E get_highest_set_bit_position(1)%0A    1%0A    %3E%3E%3E get_highest_set_bit_position(4)%0A    3%0A    %3E%3E%3E get_highest_set_bit_position(0)%0A    0%0A    %3E%3E%3E get_highest_set_bit_position(0.8)%0A    Traceback (most recent call last):%0A        ...%0A    TypeError: Input value must be an 'int' type%0A    %22%22%22%0A    if not isinstance(number, int):%0A        raise TypeError(%22Input value must be an 'int' type%22)%0A%0A    position = 0%0A    while number:%0A        position += 1%0A        number %3E%3E= 1%0A%0A    return position%0A%0A%0Aif __name__ == %22__main__%22:%0A    import doctest%0A%0A    doctest.testmod()%0A

Add function for highest set bit location (#7586)