all.py

#Question 1
def get_date_of_birth(id_number:str): 
    """
    STEP 2: Extract the date of birth from the ID number and return it as a string

    return format: DD/MM/YY: 
    """
    
    new_id = id_number[0:6]
    new_id = new_id

    int_id = new_id
    day = int_id[4:]
    month = int_id[2:4]
    year = int_id[0:2]


    return (f"{day}/{month}/{year}")

#Question 2    
def get_gender(id_number):
    """
    STEP 3: Extract the gender from the ID number using the formula below and return
    it as a string

    Formula: 1 if the ID number's 7th to 10th digit is less than 5000, the person is
    female and if it is greater than 4999, the person is male.
    """
    sequence = int(id_number[6:10])
    
    if sequence < 5000:
        return "Female"
    elif sequence >= 5000:
        return "Male"
    else:
        return "Invalid number"

#Question 3
# TODO: return shape from user input (it can't be blank and must be a valid shape!)     
def get_shape()-> str:
    # drawing different typees of shapes
    shapeList = ["circle", "triangle", "square", "rectangle","Pentagon"]
    shape = input("Please enter a shape")

    if shape not in shapeList:
        return "Invalid shape"
    else:
        return shape 

#Question 4
def draw_triangle_multiplication(n: int):
    """
    STEP 10: Draw a triangle of multiplication table up to n
    Example for n = 5:
    1 
    2 4 
    3 6 9 
    4 8 12 16 
    5 10 15 20 25 
    """
#Question 5
def draw_pyramid(n: int):
    """
    STEP 12: Draw a pyramid of height n using '*'
    Example for n = 4:
       *
      ***
     *****
    *******
    """
    

#Question 6
def fibonacci(n: int) -> int:
    """
    STEP 13: Return the nth Fibonacci number using recursion
    The Fibonacci sequence is defined as follows:
    F(0) = 0
    F(1) = 1
    F(n) = F(n-1) + F(n-2) for n > 1
    """
    if (n == 0):
        return 0
    elif (n == 1):
        return 1
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)
#Question 7
def fizz_buzz(n: int):
    """
    STEP 14: Return "Fizz" if n is divisible by 3, "Buzz" if n is divisible by 5,
    "FizzBuzz" if n is divisible by both 3 and 5, and n itself if none of those
    conditions are met.
    """
    if (n % 3) == 0:
        return "Fizz"
    elif (n % 5) == 0:
        return "Buzz"
    elif (n % 3) == 0 and (n % 5) == 0:
        return "FizzBuzz"
    else:
        return n

#Question 8
def is_prime(n: int) -> bool:
    """
    STEP 15: Return True if n is a prime number, False otherwise.
    A prime number is a natural number greater than 1 that cannot be formed by
    multiplying two smaller natural numbers.
    """
    if n % 1 == 0:
        return True
    else:
        return False

#Question 9
def factorial(n: int) -> int:
    """
    STEP 16: Return the factorial of n using recursion.
    The factorial of a non-negative integer n is the product of all positive
    integers less than or equal to n.
    """
    factorial(n) = n * factorial(n-1)
    return factorial(n)

#Question 10
def prime_triangle(n: int):
    """
    STEP 17: Draw a triangle of prime numbers up to n rows.
    Example for n = 5:
    2 
    3 5 
    7 11 13 
    17 19 23 29 
    31 37 41 43 47 
    """
    pass

#Question 11
def pascal_triangle(n: int):
    """
    STEP 19: Draw Pascal's triangle up to n rows.
    Example for n = 5:
        1
       1 1
      1 2 1
     1 3 3 1
    1 4 6 4 1
    """
    pass