Nuevas resoluciones

.vscode/settings.json

@@ -0,0 +1,4 @@
+{
+    "editor.fontSize": 12,
+    "files.autoSave": "afterDelay"
+}

exercises/binary_search_recursive/solution.py

@@ -1,11 +1,21 @@
-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
+    medio = (low + high) //2
+    if lst[medio] == target :
+        return medio 
+    else :
+        if lst[medio] < target :
+            return binary_search_recursive(lst, target, medio + 1, high)
+        elif lst[medio] > target :
+            return binary_search_recursive(lst, target,low, medio - 1)
 
 
 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

@@ -1,6 +1,21 @@
 import ast
 from pathlib import Path
 
+
+def count_vowels(s: str) -> int :
+    a = 0
+    if len(str) == 0 :
+        return 0
+
+
+
+    s = s.lower()
+    if s[0] == 'a' or s[0] == 'e' or s[0] == 'i' or s[0] == 'o' or s[0] == 'u' :
+        a +=1
+    return s[1::]
+
+
+
 def test_exercise_solutions_have_asserts() -> None:
     """Verify that all exercise solution stubs have a test() function with asserts."""
     root = Path(__file__).parent.parent

exercises/factorial_tail/solution.py

@@ -1,10 +1,11 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def factorial_tail(n: int, acc: int = 1) -> int:
-    """Tail Recursive Factorial"""
-    pass
-
+    if n == 0 :
+        return 1
+    else :
+        return factorial_tail(n-1, 1) * n
 
 def test() -> None:
     """Simple self-test for Factorial Tail."""

exercises/fast_exponentiation/solution.py

@@ -1,9 +1,11 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def fast_exponentiation(a: int, n: int) -> int:
-    """Fast Exponentiation"""
-    pass
+    if n == 0 :
+        return 1
+    else :
+        return a * fast_exponentiation(a,n-1)
 
 
 def test() -> None:

exercises/fibonacci_tail/solution.py

@@ -1,10 +1,13 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def fibonacci_tail(n: int, a: int = 0, b: int = 1) -> int:
-    """Tail Recursive Fibonacci"""
-    pass
-
+    if n <= 0 :
+        return 0
+    if n == 1 :
+        return 1 
+    else :
+        return fibonacci_tail(n-1) + fibonacci_tail(n-2)
 
 def test() -> None:
     """Simple self-test for Fibonacci Tail."""

exercises/linear_search/solution.py

@@ -12,7 +12,12 @@ def linear_search(_items: list[int], _target: int) -> int:
     >>> linear_search([], 5)
     -1
     """
-    return 0
+
+    for i in range(len(_items)) :
+        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
+    promedio = 0
+    for c in _numbers :
+        promedio +=c
+
+    resultado = promedio / len(_numbers)
+    return resultado
 
 
 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,10 +12,14 @@ def list_mode(_items: list[Any]) -> Any:
     >>> list_mode(['a', 'b', 'a'])
     'a'
     """
-    return None
+    conteo = {}
+    for c in _items :
+        conteo[c] = conteo.get(c, 0) + 1
+    moda = max(conteo, key = conteo.get)
+    return moda
 
 
-def test() -> None:
+def test() -> None :
     """Simple self-test for Most Common Element."""
     cases: list[tuple[list[Any], Any]] = [
         ([1, 2, 2, 3, 3, 3], 3),

exercises/matrix_add/solution.py

@@ -1,12 +1,16 @@
-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 []
+
+    for i in range (len(mat2)):
+        mat1[i] += mat2[i]
+
+    return mat1
 
 
 def test() -> None:

exercises/matrix_trace/solution.py

@@ -1,12 +1,12 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def matrix_trace(mat: list[list[int | float]]) -> int | float:
     """Calculates the trace of a square matrix."""
-    trace = 0
+    traza = 0
     for i in range(len(mat)):
-        trace += mat[i][i]
-    return trace
+        traza += mat[i][i]
+    return traza
 
 
 def test() -> None:

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,21 @@ def min_max_list(_items: list[int]) -> tuple[int, int] | None:
     >>> min_max_list([])
     None
     """
-    return (0, 0)
+    if not _items :
+        return None 
+    max = min = _items[0]
+
+    for i in range(len(_items)) :
+        if _items[i] > max :
+            max = _items[i]
+        if _items[i] < min :
+            min = _items[i]
+
+
+
+
+
+    return (min, max)
 
 
 def test() -> None:

exercises/palindrome/solution.py

@@ -1,4 +1,4 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def palindrome(_text: str) -> bool:
@@ -11,6 +11,8 @@ def palindrome(_text: str) -> bool:
     >>> palindrome("hello")
     False
     """
+    if _text == _text[::-1] :
+        return True
     return False
 
 

exercises/personalized_greeting/solution.py

@@ -11,7 +11,8 @@ 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,31 @@
-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
+    maxima_longitud = max(len(poly1), len(poly2))
+
+
+    final = [0 for j in range(maxima_longitud)]
+    for i in range(len(poly1)) :
+        final[i] += poly1[i]
+    for j in range(len(poly2)) :
+        final[j] += poly2[j]
+
+
+
+    if final[-1] == 0 :
+        final.pop()
     # Placeholder implementation: Add actual logic here.
     # For now, return an empty list to pass initial checks.
-    return []
+    return final
 
 
 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]), [2, 1, 1])]
     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,7 +11,7 @@ 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)

exercises/poly_mul/README.es.md

@@ -1,3 +1,4 @@
+
 # Multiplicación de Polinomios
 
 ## Contexto

exercises/prefix_sums/solution.py

@@ -1,4 +1,4 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def prefix_sums(_numbers: list[int]) -> list[int]:
@@ -10,7 +10,15 @@ def prefix_sums(_numbers: list[int]) -> list[int]:
     >>> prefix_sums([10, -10, 5])
     [10, 0, 5]
     """
-    return []
+    if not _numbers :
+        return []
+    nueva_referencia = [_numbers[0]]
+    for i in range(1, len(_numbers)) :
+        nueva_referencia.append(nueva_referencia[i-1]+_numbers[i])
+
+    return nueva_referencia
+
+
 
 
 def test() -> None:

exercises/prime_check/solution.py

@@ -1,5 +1,5 @@
-SUBMIT = False
-
+SUBMIT = True
+import math
 
 def prime_check(_n: int) -> bool:
     # noqa: ARG001
@@ -13,7 +13,14 @@ def prime_check(_n: int) -> bool:
     >>> prime_check(17)
     True
     """
-    return False
+    if _n < 2 :
+        return False 
+    raice = math.sqrt(_n)
+
+    for i in range(2, int(raice)+1) :
+        if _n % i == 0 :
+            return False 
+    return True
 
 
 def test() -> None:

exercises/recursive_min_max/solution.py

@@ -1,11 +1,23 @@
-SUBMIT = False
+SUBMIT = True
 
 
 def recursive_min_max(
     lst: list[int], low: int = 0, high: int | None = None
 ) -> tuple[int, int]:
-    """Recursive Min/Max"""
-    pass
+    if len(lst) == 0 :
+        return None, None
+
+    if len(lst) == 1 :
+        return lst[0], lst[0]
+
+    medio = len(lst) // 2
+    mins, maxs = recursive_min_max(lst[:medio])
+    mink, mas = recursive_min_max(lst[medio:])
+    maximo = max(maxs, mas)
+    minimo = min(mins, mink)  
+    return minimo, maximo
+
+
 
 
 def test() -> None:

exercises/simple_interest/__init__.py

@@ -0,0 +1,3 @@
+def simple_interest(_principal: float, _rate: float, _time: float) -> float:
+    a= _principal* _rate * _time / 100
+    return a