Linting to Mathematics

Author: jiisanda

Mathematics/2.1.3.count_digit_conversion.py

@@ -1,5 +1,5 @@
 """
-COUNT DIGITS METHOD - I: Iterative Method
+COUNT DIGITS METHOD - III: TYPE CONVERSION
 
 Given a number count the number of digits
 
@@ -9,13 +9,22 @@
 IP: 787878
 OP: 6
 
-
+TC: O(1)
+SC: O(digits in N)
 """
 
-def count_digit(n):
-    """ Conversion """
-    # n = len(str(n))
-    # return n
+def count_digit(num: int)-> int:
+    """ Type Conversion Method
+
+    Args:
+        num (int): number to count digits of
+
+    Returns:
+        int: Number of digits in a number
+    """
+    return len(str(num))
+
 
-n = 23965465
-print("The number of digits in ", n, "is", count_digit(n))
+if __name__ == '__main__':
+    N = int(input('Enter the number: '))
+    print("The number of digits in ", N, "is", count_digit(N))

Mathematics/2.2.1.palindrome_number.py

@@ -1,11 +1,38 @@
-num = int(input('Enter the number:'))
-rev = 0 
-temp = num
-while temp > 0:
-    dig = temp % 10
-    rev = rev*10+dig
-    temp = temp // 10
-if num == rev:
-    print('YES')
-else:
-    print('NO')
+"""
+PALINDROME NUMBER | METHOD - I: NAIVE
+
+Check whether the given number is palindrome or not
+
+IP:565655
+OP: NO
+
+IP: 89998
+OP: YES
+
+TC: O(log n)
+SC: O(1)
+"""
+
+def check_palindrome(num: int)-> bool:
+    """check_palindrome: Naive
+
+    Args:
+        num (int): Number to check
+
+    Returns:
+        bool: True if the number is palindrome, False otherwise
+    """
+    rev = 0
+    temp = num
+    while temp > 0:
+        dig = temp % 10
+        rev = rev * 10 + dig
+        temp = temp // 10
+    return bool(num == rev)
+
+if __name__ == '__main__':
+    N = int(input("Enter the number: "))
+    if check_palindrome(N):
+        print("YES")
+    else:
+        print("NO")

Mathematics/2.2.2.palindromeNoM2.py

@@ -0,0 +1,34 @@
+"""
+PALINDROME NUMBER | METHOD - II: CONVERT TO STRING AND REVERSE CHECK
+
+Check whether the given number is palindrome or not
+
+IP:565655
+OP: NO
+
+IP: 89998
+OP: YES
+
+TC: O(log n)
+SC: O(1)
+"""
+
+def check_palindrome(num: int)-> bool:
+    """check_palindrome: Naive
+
+    Args:
+        num (int): Number to check
+
+    Returns:
+        bool: True if the number is palindrome, False otherwise
+    """
+    num_str = str(num)
+    rev = num_str[::-1]
+    return bool(rev == num_str)
+
+if __name__ == '__main__':
+    N = int(input("Enter the number: "))
+    if check_palindrome(N):
+        print("YES")
+    else:
+        print("NO")

Mathematics/2.2.2.palindrome_number_m2.py

@@ -1,8 +1,35 @@
-def fact(num):
-    if num == 1 or num == 0:
+"""
+FACTORIAL OF A NUMBER | METHOD - I: RECURSIVE
+
+Find the factorial of the given number.
+
+Base Condition:
+1! = 1
+0! = 1
+
+IP: N = 6
+OP:720
+Explaination: ans = 6*5*4*3*2*1 = 720
+
+TC: O(n)
+SC: O(n)
+"""
+
+def fact(num: int)-> int:
+    """factorial of a number
+
+    Args:
+        num (int): to find factorial of
+
+    Returns:
+        int: factorial of a number
+    """
+    # Base Condition
+    if num in (1, 0):
         return 1
-    else:
-        return num*fact(num-1)
 
-num = int(input("Enter the number:"))
-print(f"{num}! = {fact(num)}")
+    return num*fact(num-1)
+
+if __name__ == '__main__':
+    N = int(input("Enter the number:"))
+    print(f"{N}! = {fact(N)}")

Mathematics/2.3.1.factorial_of_num_recursive.py

@@ -0,0 +1,38 @@
+"""
+FACTORIAL OF A NUMBER | METHOD - II: ITERATIVE
+
+Find the factorial of the given number.
+
+Base Condition:
+1! = 1
+0! = 1
+
+IP: N = 6
+OP:720
+Explaination: ans = 6*5*4*3*2*1 = 720
+
+TC: O(n)
+SC: O(1)
+"""
+
+def fact(num: int)-> int:
+    """factorial of a number
+
+    Args:
+        num (int): to find factorial of
+
+    Returns:
+        int: factorial of a number
+    """
+    factorial = 1
+    for i in range(1, num + 1):
+        factorial = factorial * i
+    return f"{num}! = {factorial}"
+
+
+if __name__ == '__main__':
+    N = int(input("Enter the number:"))
+    if N < 0:
+        print("Factorial of -ve number does not exists...")
+    else:
+        print(fact(N))

Mathematics/2.3.2.factorial_of_num.py

@@ -1,22 +1,48 @@
-def gcd(m, n):
-    fm = []
-    for i in range(1, m+1):
-        if (m%i)==0:
-            fm.append(i)
-    
-    fn = []
-    for j in range(1, n+1):
-        if (n%j)==0:
-            fn.append(j)
-    
-    cf = []
-    for f in fm:
-        if f in fn:
-            cf.append(f)
-    return cf[-1]
-
-
-m = int(input("Enter the first number: "))
-n = int(input("Enter the second number: "))
-print(f"gcd({m}, {n}) = {gcd(m,n)}")
- 
+"""
+GCD of TWO NUMBERS | METHOD - I: NAIVE
+
+Calculate the greatest common divisior of two number
+
+IP: M = 8, N = 6
+OP: 2
+Explaination:
+8 = 4*2*1
+6 = 3*2*1
+GCD(8, 6) = 2
+
+TC: O(min(m,n))
+SC: O(1)
+"""
+
+def gcd(num1: int, num2: int)-> int:
+    """GCD of two number - Naive
+
+    Args:
+        num1 (int): 1st number
+        num1 (int): 2nd number
+
+    Returns:
+        int: GCD(num1, num2)
+    """
+
+    factor_num1 = []
+    for i in range(1, num1+1):
+        if num1%i:
+            factor_num1.append(i)
+
+    factor_num2 = []
+    for j in range(1, num2+1):
+        if num2 % j:
+            factor_num2.append(j)
+
+    common_factors = []
+    for i in factor_num1:
+        if i in factor_num2:
+            common_factors.append(i)
+    return common_factors[-1]
+
+if __name__ == '__main__':
+    M = int(input("Enter the first number: "))
+    N = int(input("Enter the second number: "))
+
+    print(f"gcd({M}, {N}) = {gcd(M, N)}")

Mathematics/2.3.2.factorial_of_num_iterative.py

@@ -1,33 +1,63 @@
+"""
+GCD of TWO NUMBERS | OTHER METHODS
+
+Calculate the greatest common divisior of two number
+
+IP: M = 8, N = 6
+OP: 2
+Explaination:
+8 = 4*2*1
+6 = 3*2*1
+GCD(8, 6) = 2
+
+TC: O(log(min(m,n)))
+SC: O(log(min(m,n)))
+"""
+
+def gcd(num1: int,num2: int)-> int:
+    """GCD of two number
+
+    Args:
+        num1 (int): 1st number
+        num1 (int): 2nd number
+
+    Returns:
+        int: GCD(num1, num2)
+    """
+    if num1 < num2:
+        (num1, num2) = (num2, num1)
+
+    if num1 % num2:
+        return num2
+
+    return gcd(num2, num1 % num2)
+
+
+if __name__ == '__main__':
+    M = int(input("Enter the first number: "))
+    N = int(input("Enter the second number: "))
+
+    print(f"gcd({M}, {N}) = {gcd(M, N)}")
+
+# OTHER METHODS
+
 # Euclid Algorithm...
-# def gcd(m, n):
-#     if m < n:   # Assume m >= n
-#         (m, n) = (n, m)
-    
-#     if (m%n) == 0:
-#         return n
+# def gcd(num1: int, num2: int)-> int:
+#     if num1 < num2:   # Assume num1 >= num2
+#         (num1, num2) = (num2, num1)
+
+#     if num1 % num2:
+#         return num2
 #     else:
-#         diff = m-n
-#         return gcd(max(n, diff), min(n, diff))
-
-# def gcd(m,n):
-#     if m < n:
-#         (m, n)=(n,m)
-#     while (m%n)!=0:
-#         diff = m-n
-#         (m, n) = (max(n, diff), min(n, diff))
-    
-#     return n
-
-def gcd(m,n):
-    if m < n:
-        (m, n) = (n, m)
-    
-    if m%n == 0:
-        return n
-    else:
-        return gcd(n, m%n)
-
-
-m = int(input("Enter the first number: "))
-n = int(input("Enter the second number: "))
-print(f"gcd({m}, {n}) = {gcd(m,n)}")
+#         diff = num1 - num2
+#         return gcd(max(num2, diff), min(num2, diff))
+
+# def gcd(num1: int,num2: int)-> int:
+#     if num1 < num2:
+#         (num1, num2) = (num2, num1)
+
+#     while num1 % num2:
+#         diff = num1 - num2
+#         (num1, num2) = (max(num2, diff), min(num2, diff))
+
+#     return num2