Sadamingh

def blast_off(n):
  if n == 0:
      print("Blastoff 🚀")
  else:
      print(n)
      blast_off(n-1)
      
blast_off(5)

Sadamingh

def fib(n):
    if n == 0 or n == 1:
        return n
    else:
        return fib(n-1) + fib(n-2)

fib(7)

Sadamingh

def my_gcd(a, b):
    if b == 0:
        return abs(a)
    else:
        return my_gcd(b, a%b)

# test
my_gcd(0, 0)
my_gcd(1, 1)
my_gcd(12, 8)

Sadamingh

def len_list(seq):
    if seq == []:
        return 0
    else:
        return 1 + len_list(seq[:-1])

len_list([1, 2, 3])

Sadamingh

def len_list(seq):
    if seq == []:
        return 0
    else:
        return 1 + len_list(seq[:-1])

len_list([1, 2, 3])

Sadamingh

def reverse_string(string: str) -> str:
    if string == "":
        return ""
    else:
        return string[-1] + reverse_string(string[:-1])
      
      
reverse_string("stressed")

Sadamingh

def bound_value(value: float, min_value: float, max_value: float) -> float:
    return min(max_value, max(value, min_value))
  
bound_value(235,  min_value=0, max_value=255)

Sadamingh

def fib(n: int) -> List[int]:

    fib_seq = [0, 1] 

    while len(fib_seq) < n:
        fib_seq.append(sum(fib_seq[-2:]))
    
    return fib_seq

Sadamingh

def my_gcd(a: int, b: int) -> int:

    while b:              
        a, b = b, a % b 
        
    return abs(a)  
    

Sadamingh

def constrained_sum(nums: List[int]) -> int:
    
    current, previous = 0, 0

    for value in nums: 
        previous, current = current, max(current, previous + value) 
        
    return current