Update

Author: xurten

python_tests/test_10_sort_list.py

@@ -0,0 +1,10 @@
+# Task 10
+# Implement a function to sort a list in ascending order.
+
+def sort_list(numbers):
+    return sorted(numbers)
+
+
+def test_sort_list():
+    numbers = [5, 4, 3, 2, 1]
+    assert sort_list(numbers) == [1, 2, 3, 4, 5]

python_tests/test_11_count_element_in_list.py

@@ -0,0 +1,20 @@
+# Task 11
+# Create a function to count the occurrence of a specific element in a list.
+
+def count_element_in_list(numbers, element):
+    count = 0
+    for number in numbers:
+        if number == element:
+            count += 1
+    return count
+
+
+def test_count_element_in_list():
+    numbers = [1, 2, 3, 4, 5, 1, 2, 3]
+    assert count_element_in_list(numbers, 1) == 2
+    assert count_element_in_list(numbers, 2) == 2
+    assert count_element_in_list(numbers, 3) == 2
+    assert count_element_in_list(numbers, 4) == 1
+    assert count_element_in_list(numbers, 5) == 1
+    assert count_element_in_list(numbers, 6) == 0
+

python_tests/test_3_fibonacci.py

@@ -21,7 +21,6 @@ def get_fibonacci_iterative(n: int) -> int:
     return fibonacci_first
 
 
-# Test Section
 @pytest.mark.parametrize("n, expected_value", [(7, 13), (20, 6765)])
 def test_fibonacci_recursive(n, expected_value):
     assert get_fibonacci_recursive(n) == expected_value

python_tests/test_5_reverse_string.py

@@ -27,4 +27,4 @@ def test_reverse_string_empty():
 def test_reverse_string_with_bool():
     message = True
     with pytest.raises(Exception):
-        reverse_string(message)
+        reverse_string(message)

python_tests/test_8_find_max.py

@@ -0,0 +1,15 @@
+# Task 8
+# Write a program to find the maximum number in a list.
+
+
+def find_max(numbers):
+    max = numbers[0]
+    for number in numbers:
+        if number > max:
+            max = number
+    return max
+
+
+def test_find_max():
+    numbers = [1, 2, 3, 4, 5]
+    assert find_max(numbers) == 5

python_tests/test_9_remove_duplicates.py

@@ -0,0 +1,13 @@
+# Task 9
+# Create a function to remove duplicates from a list.
+def remove_duplicates(numbers):
+    unique_numbers = []
+    for number in numbers:
+        if number not in unique_numbers:
+            unique_numbers.append(number)
+    return unique_numbers
+
+
+def test_remove_duplicates():
+    numbers = [1, 2, 3, 4, 5, 1, 2, 3]
+    assert remove_duplicates(numbers) == [1, 2, 3, 4, 5]