Added a hex-bin.py file in conversion.py

arithmetic_analysis/newton_method.py

@@ -7,11 +7,7 @@
 
 
 # function is the f(x) and derivative is the f'(x)
-def newton(
-    function: RealFunc,
-    derivative: RealFunc,
-    starting_int: int,
-) -> float:
+def newton(function: RealFunc, derivative: RealFunc, starting_int: int,) -> float:
     """
     >>> newton(lambda x: x ** 3 - 2 * x - 5, lambda x: 3 * x ** 2 - 2, 3)
     2.0945514815423474

conversions/hex-bin.py

@@ -0,0 +1,57 @@
+#  CONVERT HEXADECIMAL TO BINARY
+import math
+
+
+def hex_to_bin(hex_num: str) -> int:
+    """
+    Convert a hexadecimal value to its decimal equivalent
+    #https://stackoverflow.com/questions/1425493/convert-hex-to-binary
+    Here, we have used " >> " bitwise operator
+    Bitwise right shift: 
+    Shifts the bits of the number to the right and fills 0 on voids left as a result. 
+    Similar effect as of dividing the number with some power of two.
+    Example: 
+    a = 10
+    a >> 1 = 5 
+
+    >>> hex_to_bin("AC")
+    10101100
+    >>> hex_to_bin("9A4")
+    100110100100
+    >>> hex_to_bin("   12f   ")
+    100101111
+    >>> hex_to_bin("FfFf")
+    1111111111111111
+    >>> hex_to_bin("F-f")
+    False
+    >>> hex_to_bin("")
+    False
+    """
+
+    bin_str: str = ""
+    hex_str: str = hex_num.strip()
+
+    if not hex_str:
+        return False
+
+    is_negative: bool = hex_str[0] == "-"
+
+    if is_negative:
+        hex_str = hex_str[1:]
+    try:
+        int_num: int = int(hex_str, 16)
+    except ValueError:
+        return False
+
+    while int_num > 0:
+        str_num: str = str(int_num % 2)
+        bin_str = str_num + bin_str
+        int_num = int_num >> 1
+
+    return int("-" + "".join(bin_str)) if is_negative else int(bin_str)
+
+
+if __name__ == "__main__":
+    import doctest
+
+    doctest.testmod()

matrix/matrix_operation.py

@@ -168,9 +168,7 @@ def main():
     matrix_c = [[11, 12, 13, 14], [21, 22, 23, 24], [31, 32, 33, 34], [41, 42, 43, 44]]
     matrix_d = [[3, 0, 2], [2, 0, -2], [0, 1, 1]]
     print(f"Add Operation, {add(matrix_a, matrix_b) = } \n")
-    print(
-        f"Multiply Operation, {multiply(matrix_a, matrix_b) = } \n",
-    )
+    print(f"Multiply Operation, {multiply(matrix_a, matrix_b) = } \n",)
     print(f"Identity: {identity(5)}\n")
     print(f"Minor of {matrix_c} = {minor(matrix_c, 1, 2)} \n")
     print(f"Determinant of {matrix_b} = {determinant(matrix_b)} \n")

strings/can_string_be_rearranged_as_palindrome.py

@@ -8,9 +8,7 @@
 # Counter is faster for long strings and non-Counter is faster for short strings.
 
 
-def can_string_be_rearranged_as_palindrome_counter(
-    input_str: str = "",
-) -> bool:
+def can_string_be_rearranged_as_palindrome_counter(input_str: str = "",) -> bool:
     """
     A Palindrome is a String that reads the same forward as it does backwards.
     Examples of Palindromes mom, dad, malayalam