First exercises check

exercises/binary_search_recursive/solution.py

@@ -1,11 +1,22 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def binary_search_recursive(
     lst: list[int], target: int, low: int = 0, high: int | None = None
 ) -> int:
-    """Recursive Binary Search"""
-    pass
+    if(high is None): 
+        high = len(lst) - 1
+
+    if(low > high): 
+        return -1
+
+    mid = (low + high) // 2
+    if(lst[mid] == target):
+        return mid
+    elif(lst[mid] < target):
+        return binary_search_recursive(lst, target, low, mid - 1)
+    else:
+        return binary_search_recursive(lst, target, mid + 1, high)
 
 
 def test() -> None:

exercises/case_inverter/solution.py

@@ -1,4 +1,4 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def case_inverter(s: str) -> str:  # noqa: ARG001
@@ -21,8 +21,8 @@ def test() -> None:
     cases = [
         ("Hello World!", "hELLO wORLD!"),
         ("", ""),
-        ("all lower", "ALL UPPER"),
-        ("ALL UPPER", "all lower"),
+        ("all lower", "ALL LOWER"),
+        ("ALL UPPER", "all upper"),
         ("1234567890 !@#$%^&*()", "1234567890 !@#$%^&*()"),
         ("Python 3.12", "pYTHON 3.12"),
     ]

exercises/celsius_to_fahrenheit/solution.py

@@ -1,4 +1,4 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def celsius_to_fahrenheit(_celsius: float) -> float:
@@ -13,7 +13,7 @@ def celsius_to_fahrenheit(_celsius: float) -> float:
     >>> celsius_to_fahrenheit(-40)
     -40.0
     """
-    return 0.0
+    return (_celsius * 9/5) + 32
 
 
 def test() -> None:

exercises/char_frequency/solution.py

@@ -1,4 +1,4 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def char_frequency(s: str) -> dict[str, int]:

exercises/count_vowels/solution.py

@@ -36,6 +36,7 @@ def test_exercise_solutions_have_asserts() -> None:
             f"test() function in {exercise.name} missing assert statement"
         )
 
+
 # Add a test function with an assert for count_vowels
 def test():
     # Example: assert count_vowels("hello") == 2

exercises/factorial_iterative/solution.py

@@ -1,4 +1,4 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def factorial_iterative(_n: int) -> int:
@@ -11,7 +11,10 @@ def factorial_iterative(_n: int) -> int:
     >>> factorial_iterative(5)
     120
     """
-    return 0
+    fac = 1
+    for i in range(1, _n + 1):
+        fac *= i
+    return fac
 
 
 def test() -> None:

exercises/factorial_tail/solution.py

@@ -1,9 +1,10 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def factorial_tail(n: int, acc: int = 1) -> int:
-    """Tail Recursive Factorial"""
-    pass
+    if(n <= 0): 
+        return acc
+    return factorial_tail(n - 1, n * acc)
 
 
 def test() -> None:

exercises/fast_exponentiation/solution.py

@@ -1,9 +1,18 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def fast_exponentiation(a: int, n: int) -> int:
-    """Fast Exponentiation"""
-    pass
+    if(n < 0):
+        return 1 / fast_exponentiation(a, -n)
+    elif(n == 0):
+        return 1
+    elif(n == 1):
+        return a
+    last = fast_exponentiation(a, n // 2)
+    last *= last
+    if(n % 2 == 1):
+        last *= a
+    return last
 
 
 def test() -> None:

exercises/fibonacci/solution.py

@@ -1,20 +1,15 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def fibonacci(n: int) -> int:
-    """Calculates the n-th Fibonacci number.
-
-    Example usage:
-    >>> fibonacci(0)
-    0
-    >>> fibonacci(1)
-    1
-    >>> fibonacci(5)
-    5
-    >>> fibonacci(10)
-    55
-    """
-    return 0
+    arr = [0, 1]
+    if(n < 0):
+        return 0
+    elif(n < 2):
+        return arr[n]
+    for i in range(n - 1):
+        arr[i % 2] = sum(arr)
+    return arr[n % 2]
 
 
 def test() -> None:

exercises/fibonacci_tail/solution.py

@@ -1,9 +1,10 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def fibonacci_tail(n: int, a: int = 0, b: int = 1) -> int:
-    """Tail Recursive Fibonacci"""
-    pass
+    if(n <= 0):
+        return a
+    return fibonacci_tail(n - 1, b, a + b)
 
 
 def test() -> None:

exercises/hello_world/solution.py

@@ -1,4 +1,4 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def hello_world() -> str:
@@ -8,7 +8,7 @@ def hello_world() -> str:
     >>> hello_world()
     'Hello, World!'
     """
-    return ""
+    return "Hello, World!"
 
 
 def test() -> None:

exercises/linear_search/solution.py

@@ -1,4 +1,4 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def linear_search(_items: list[int], _target: int) -> int:
@@ -12,7 +12,11 @@ def linear_search(_items: list[int], _target: int) -> int:
     >>> linear_search([], 5)
     -1
     """
-    return 0
+    n = len(_items)
+    for i in range(n):
+        if(_items[i] == _target):
+            return i
+    return -1
 
 
 def test() -> None:

exercises/list_average/solution.py

@@ -1,4 +1,4 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def list_average(_numbers: list[float]) -> float:
@@ -10,7 +10,12 @@ def list_average(_numbers: list[float]) -> float:
     >>> list_average([10, 20, 30])
     20.0
     """
-    return 0.0
+    n = len(_numbers)
+    if(n <= 0): return 0
+    _sum = 0
+    for i in range(n):
+        _sum += _numbers[i]
+    return _sum / n
 
 
 def test() -> None:

exercises/list_mode/solution.py

@@ -1,6 +1,6 @@
 from typing import Any
 
-SUBMIT = False
+SUBMIT = True
 
 
 def list_mode(_items: list[Any]) -> Any:
@@ -12,7 +12,19 @@ def list_mode(_items: list[Any]) -> Any:
     >>> list_mode(['a', 'b', 'a'])
     'a'
     """
-    return None
+    if(_items.__len__() <= 0):
+        return None
+    _map = {}
+    for item in _items:
+        if item in _map:
+            _map[item] += 1
+        else:
+            _map[item] = 1
+    _item, _num = _items[0], _map[_items[0]]
+    for item, num in _map.items():
+        if(num > _num):
+            _item, _num = item, num
+    return _item
 
 
 def test() -> None:

exercises/matrix_add/solution.py

@@ -1,17 +1,21 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def matrix_add(mat1: list[list[int | float]], mat2: list[list[int | float]]) -> list[list[int | float]]:
     """Adds two matrices."""
     # Placeholder implementation
-    _ = mat1
-    _ = mat2
-    return []
+    n = len(mat1)
+    m = len(mat1[0])
+    mat = [[0] * m] * n
+    for i in range(n):
+        for j in range(m):
+            mat[i][j] = mat1[i][j] + mat2[i][j]
+    return mat
 
 
 def test() -> None:
     """Simple self-test for Matrix Addition."""
-    cases = [(([1, 2], [3, 4]), [4, 6])]  # Example matrices
+    cases = [(([[1, 2]], [[3, 4]]), [[4, 6]])]  # Example matrices
     for input_data, expected in cases:
         try:
             res = matrix_add(*input_data)

exercises/matrix_trace/solution.py

@@ -1,4 +1,4 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def matrix_trace(mat: list[list[int | float]]) -> int | float:

exercises/min_max_list/solution.py

@@ -1,4 +1,4 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def min_max_list(_items: list[int]) -> tuple[int, int] | None:
@@ -12,7 +12,13 @@ def min_max_list(_items: list[int]) -> tuple[int, int] | None:
     >>> min_max_list([])
     None
     """
-    return (0, 0)
+    n = len(_items)
+    if(n <= 0): return None
+    _min, _max = _items[0], _items[0] 
+    for i in range(1, n):
+        _min = min(_items[i], _min)
+        _max = max(_items[i], _max)
+    return (_min, _max)
 
 
 def test() -> None:

exercises/palindrome/solution.py

@@ -1,17 +1,12 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def palindrome(_text: str) -> bool:
-    # noqa: ARG001
-    """Checks if a string is a palindrome.
-
-    Example usage:
-    >>> palindrome("racecar")
-    True
-    >>> palindrome("hello")
-    False
-    """
-    return False
+    n = len(_text)
+    for i in range(n // 2):
+        if(_text[i] != _text[n - 1 - i]):
+            return False
+    return True
 
 
 def test() -> None:

exercises/personalized_greeting/solution.py

@@ -1,4 +1,4 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def personalized_greeting(_name: str, _age: int) -> str:
@@ -11,7 +11,7 @@ def personalized_greeting(_name: str, _age: int) -> str:
     >>> personalized_greeting("Bob", 30)
     'Hello Bob, you are 30 years old'
     """
-    return ""
+    return f"Hello {_name}, you are {_age} years old"
 
 
 def test() -> None:

exercises/poly_add/solution.py

@@ -1,18 +1,22 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def poly_add(poly1: list[int | float], poly2: list[int | float]) -> list[int | float]:
     """Adds two polynomials."""
-    _poly1 = poly1
-    _poly2 = poly2
-    # Placeholder implementation: Add actual logic here.
-    # For now, return an empty list to pass initial checks.
-    return []
+    poly_min, poly_max = None, None
+    if(len(poly1) > len(poly2)):
+        poly_min, poly_max = poly2, poly1[:]
+    else:
+        poly_min, poly_max = poly1, poly2[:]
+    offset = len(poly_max) - len(poly_min)
+    for i in range(len(poly_min)):
+        poly_max[offset + i] += poly_min[i]
+    return poly_max
 
 
 def test() -> None:
     """Simple self-test for Polynomial Addition."""
-    cases = [(([1, 2], [3, 4]), [4, 6]), (([1, 0, 1], [1, 1]), [1, 1, 1])]
+    cases = [(([1, 2], [3, 4]), [4, 6]), (([1, 0, 1], [1, 1]), [1, 1, 2])]
     for input_data, expected in cases:
         try:
             res = poly_add(*input_data)

exercises/poly_evaluate/solution.py

@@ -1,4 +1,4 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def poly_evaluate(poly: list[int | float], x: int | float) -> int | float:
@@ -11,10 +11,10 @@ def poly_evaluate(poly: list[int | float], x: int | float) -> int | float:
 
 def test() -> None:
     """Simple self-test for Polynomial Evaluation."""
-    cases = [(([1, 2, 3], 2), 17), (([5], 3), 5), ([], 0), (([1, -1, 1], 1), 1)]
+    cases = [(([1, 2, 3], 2), 17), (([5], 3), 5), (([], 0), 0), (([1, -1, 1], 1), 1)]
     for input_data, expected in cases:
         try:
-            res = poly_evaluate(*input_data)
+            res = poly_evaluate(input_data[0], input_data[1])
             assert abs(res - expected) < 1e-9, (
                 f"Failed for input {input_data}: expected {expected}, got {res}"
             )