chore: swap coveralls to codecov, python 3.14

Justintime50 · Justintime50 · commit d092547dc430 · 2025-11-18T16:47:16.000-07:00
diff --git a/.github/workflows/build.yml b/.github/workflows/build.yml
@@ -19,35 +19,34 @@ jobs:
   lint:
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@v4
-      - uses: extractions/setup-just@v2
-      - uses: actions/setup-python@v5
+      - uses: actions/checkout@v5
+      - uses: extractions/setup-just@v3
+      - uses: actions/setup-python@v6
         with:
-          python-version: '3.13'
+          python-version: '3.14'
       - run: just install lint
   test:
     runs-on: ubuntu-latest
     strategy:
       matrix:
-        pythonversion: ['3.8', '3.9', '3.10', '3.11', '3.12', '3.13']
+        pythonversion: ['3.10', '3.11', '3.12', '3.13', '3.14']
     steps:
-      - uses: actions/checkout@v4
-      - uses: extractions/setup-just@v2
-      - uses: actions/setup-python@v5
+      - uses: actions/checkout@v5
+      - uses: extractions/setup-just@v3
+      - uses: actions/setup-python@v6
         with:
           python-version: ${{ matrix.pythonversion }}
       - run: just install coverage
   coverage:
     if: github.ref == 'refs/heads/main'
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@v4
-      - uses: extractions/setup-just@v2
-      - uses: actions/setup-python@v5
+      - uses: actions/checkout@v5
+      - uses: extractions/setup-just@v3
+      - uses: actions/setup-python@v6
         with:
-          python-version: '3.13'
+          python-version: '3.14'
       - run: just install coverage
-      - uses: coverallsapp/github-action@v2
+      - uses: codecov/codecov-action@v5
         with:
-          github-token: ${{ secrets.GITHUB_TOKEN }}
-          path-to-lcov: './coverage.lcov'
+          token: ${{ secrets.CODECOV_TOKEN }}
diff --git a/CHANGELOG.md b/CHANGELOG.md
diff --git a/README.md b/README.md
@@ -5,7 +5,7 @@
 Classic algorithms including Fizz Buzz, Bubble Sort, the Fibonacci Sequence, a Sudoku solver, and more.
 
 [![Build](https://github.com/Justintime50/algorithms/workflows/build/badge.svg)](https://github.com/Justintime50/algorithms/actions)
-[![Coverage Status](https://coveralls.io/repos/github/Justintime50/algorithms/badge.svg?branch=main)](https://coveralls.io/github/Justintime50/algorithms?branch=main)
+[![Coverage Status](https://img.shields.io/codecov/c/github/justintime50/algorithms)](https://app.codecov.io/github/Justintime50/algorithms)
 [![Licence](https://img.shields.io/github/license/justintime50/algorithms)](LICENSE)
 
 <img src="https://raw.githubusercontent.com/justintime50/assets/main/src/algorithms/showcase.png" alt="Showcase">
diff --git a/algorithms/recursion/invert_binary_tree.py b/algorithms/recursion/invert_binary_tree.py
@@ -27,7 +27,7 @@ def invert_tree(node: TreeNode) -> TreeNode:
 def print_tree(node: TreeNode):
     """Print the output of the tree."""
     # Print the top level node
-    print(node.val, end='')
+    print(node.val, end="")
 
     # If other nodes exist, print them too
     if node.left:
@@ -46,19 +46,19 @@ def main() -> TreeNode:
     tree.right.left = TreeNode(6)
     tree.right.right = TreeNode(7)
 
-    print('Original tree:')
+    print("Original tree:")
     print_tree(tree)
-    print('')
+    print("")
 
     # Send the entire tree to be inverted
     inverted_tree = invert_tree(tree)
 
-    print('Inverted tree:')
+    print("Inverted tree:")
     print_tree(inverted_tree)
-    print('')
+    print("")
 
     return inverted_tree
 
 
-if __name__ == '__main__':
+if __name__ == "__main__":
     main()
diff --git a/algorithms/recursion/sudoku_solver.py b/algorithms/recursion/sudoku_solver.py
@@ -45,27 +45,27 @@ def solve_sudoku_puzzle():
     count_numbers_added = count_numbers_backtracked = 0
     grid = GRID  # Reassign here so we can pass it around and edit the values
 
-    print('Original:')
+    print("Original:")
     for row in grid:
         print(row)
-    print('\n')
+    print("\n")
 
     grid_solved = _solve_puzzle(grid)
 
     if grid_solved:
-        print('Solved:')
+        print("Solved:")
         for row in grid:
             print(row)
-        print(f'Numbers put into the Sudoku puzzle: {count_numbers_added}')
-        print(f'Numbers that had to be backtracked due to a dead-end: {count_numbers_backtracked}')
+        print(f"Numbers put into the Sudoku puzzle: {count_numbers_added}")
+        print(f"Numbers that had to be backtracked due to a dead-end: {count_numbers_backtracked}")
 
         # TODO: Count how many solutions the solver came up with
         # Only show this prompt if there are indeed more solutions
         # show_more = input('Show other solutions? (yes/no)')
         # if show_more.lower() != 'yes':
         #     raise Error('Skipped showing other solutions.')
     else:
-        raise Exception('No solution!')
+        raise Exception("No solution!")
 
 
 def _check_valid_number(y: int, x: int, n: int, grid: List[List[int]]):
@@ -127,5 +127,5 @@ def main():
     solve_sudoku_puzzle()
 
 
-if __name__ == '__main__':
+if __name__ == "__main__":
     main()
diff --git a/algorithms/search/breadth_first_search.py b/algorithms/search/breadth_first_search.py
@@ -31,5 +31,5 @@ def breadth_first_search(visited, graph, node):
     return traversal_order
 
 
-if __name__ == '__main__':
+if __name__ == "__main__":
     main()
diff --git a/algorithms/search/depth_first_search.py b/algorithms/search/depth_first_search.py
@@ -22,5 +22,5 @@ def depth_first_search(visited, traversal_order, graph, node):
     return traversal_order
 
 
-if __name__ == '__main__':
+if __name__ == "__main__":
     main()
diff --git a/algorithms/sequences/fibonacci_sequence.py b/algorithms/sequences/fibonacci_sequence.py
@@ -12,26 +12,26 @@
 """
 
 
-ITERATIONS = int(os.getenv('ITERATIONS', 20))
+ITERATIONS = int(os.getenv("ITERATIONS", 20))
 
 
 def generate_fibonacci_sequence():
     _validate_iterations()
-    print(f'The Fibonacci Sequence to {ITERATIONS} iterations:')
+    print(f"The Fibonacci Sequence to {ITERATIONS} iterations:")
     fibonacci_sequence = _iterate_fibonacci_sequence()
-    print(', '.join([str(number) for number in fibonacci_sequence]))
+    print(", ".join([str(number) for number in fibonacci_sequence]))
 
 
 def _validate_iterations():
     """Ensure the iterations value is within the acceptable range."""
     if ITERATIONS >= 94:
         raise ValueError(
-            'You have requested too many iterations - computers can literally'
-            ' only print up to 93 iterations before the Fibonacci number exceeds'
-            ' the max value allowed in memory. Please select a lower number and try again.'
+            "You have requested too many iterations - computers can literally"
+            " only print up to 93 iterations before the Fibonacci number exceeds"
+            " the max value allowed in memory. Please select a lower number and try again."
         )
     if ITERATIONS < 1:
-        raise ValueError('ITERATIONS must be greater than or equal to 1.')
+        raise ValueError("ITERATIONS must be greater than or equal to 1.")
 
 
 def _iterate_fibonacci_sequence() -> Iterator[int]:
@@ -52,5 +52,5 @@ def main():
     generate_fibonacci_sequence()
 
 
-if __name__ == '__main__':
+if __name__ == "__main__":
     main()
diff --git a/algorithms/sequences/fizzbuzz.py b/algorithms/sequences/fizzbuzz.py
@@ -17,13 +17,13 @@
 """
 
 
-ITERATIONS = int(os.getenv('ITERATIONS', 15))
+ITERATIONS = int(os.getenv("ITERATIONS", 15))
 
 
 def generate_fizzbuzz():
     """Iterate through numbers and print FizzBuzz to console."""
     _validate_iterations()
-    print(f'Fizz Buzz to {ITERATIONS} iterations:')
+    print(f"Fizz Buzz to {ITERATIONS} iterations:")
 
     for iteration in range(1, ITERATIONS + 1):
         output = _determine_output(iteration)
@@ -33,7 +33,7 @@ def generate_fizzbuzz():
 def _validate_iterations():
     """Validate the iterations before proceeding."""
     if ITERATIONS < 1:
-        raise ValueError('ITERATIONS must be greater than or equal to 1.')
+        raise ValueError("ITERATIONS must be greater than or equal to 1.")
 
 
 def _determine_output(iteration) -> str:
@@ -42,11 +42,11 @@ def _determine_output(iteration) -> str:
     buzz = iteration % 5 == 0
 
     if fizz and buzz:
-        output = 'FizzBuzz'
+        output = "FizzBuzz"
     elif fizz:
-        output = 'Fizz'
+        output = "Fizz"
     elif buzz:
-        output = 'Buzz'
+        output = "Buzz"
     else:
         output = str(iteration)
 
@@ -57,5 +57,5 @@ def main():
     generate_fizzbuzz()
 
 
-if __name__ == '__main__':
+if __name__ == "__main__":
     main()
diff --git a/algorithms/sequences/lockers.py b/algorithms/sequences/lockers.py
@@ -42,5 +42,5 @@ def main():
     print(solution)
 
 
-if __name__ == '__main__':
+if __name__ == "__main__":
     main()
diff --git a/algorithms/sorting/bubble_sort.py b/algorithms/sorting/bubble_sort.py
@@ -36,13 +36,13 @@ def bubble_sort() -> List[int]:
     i = 1
     num_times_skipped = 0
 
-    print(f'Original: {LIST}')
+    print(f"Original: {LIST}")
     start_time = datetime.now()
     while num_times_skipped + 1 != len(LIST):
         try:
             if LIST[next_index] < LIST[previous_index] and LIST[next_index] != LIST[previous_index]:
                 new_array.insert(next_index, new_array.pop(previous_index))
-                print(f'{new_array} => Swapped {LIST[next_index]} and {LIST[previous_index]}')
+                print(f"{new_array} => Swapped {LIST[next_index]} and {LIST[previous_index]}")
                 previous_index += 1
                 next_index += 1
             else:
@@ -55,7 +55,7 @@ def bubble_sort() -> List[int]:
             num_times_skipped = 0
             i += 1
     end_time = datetime.now() - start_time
-    print(f'List sorted successfully in {end_time} with Bubble Sort Algorithm!')
+    print(f"List sorted successfully in {end_time} with Bubble Sort Algorithm!")
 
     return new_array
 
@@ -64,5 +64,5 @@ def main():
     bubble_sort()
 
 
-if __name__ == '__main__':
+if __name__ == "__main__":
     main()
diff --git a/algorithms/sorting/wordle_solver.py b/algorithms/sorting/wordle_solver.py
@@ -32,7 +32,7 @@
 CORRECT_LETTERS_WRONG_POSITIONS: Dict[str, int] = {}
 
 # Place letters here that are verified correct (green background)
-VERIFIED_LETTERS: List[str] = ['', '', '', '', '']
+VERIFIED_LETTERS: List[str] = ["", "", "", "", ""]
 
 
 """Do not edit code below this line!"""
@@ -49,22 +49,22 @@ def main():
     letters long. Some words have repeating letters such as `knoll`
     """
     # TODO: Longterm we should grab the lists from the site in the chance they get updated overtime
-    answer_list = _read_file(os.path.join('algorithms', 'assets', 'wordle_answer_list.json'))
+    answer_list = _read_file(os.path.join("algorithms", "assets", "wordle_answer_list.json"))
     non_answer_possible_words = _read_file(
-        os.path.join('algorithms', 'assets', 'wordle_non_answer_possible_words_list.json')
+        os.path.join("algorithms", "assets", "wordle_non_answer_possible_words_list.json")
     )
     combined_lists = answer_list + non_answer_possible_words  # noqa
 
     total_numbers = len(answer_list + non_answer_possible_words)
-    print('Total number of Wordles:', total_numbers)
+    print("Total number of Wordles:", total_numbers)
 
     possible_words = get_best_guess(
         answer_list
     )  # Replace the param with `combined_lists` if desired, but the answers come from `answer_list`
     most_common_start, most_common_letters, possible_words = get_most_common(possible_words)
     best_words = get_best_words(most_common_letters, possible_words)
 
-    print(f'Top {NUM_BEST_GUESSES} Best Guesses:')
+    print(f"Top {NUM_BEST_GUESSES} Best Guesses:")
     # Sort the best guesses by best starting letter first, then highest weighted
     for word in sorted(best_words, key=lambda x: x[0].startswith(most_common_start[0][0]), reverse=True)[
         :NUM_BEST_GUESSES
@@ -88,8 +88,8 @@ def get_most_common(possible_words):
 
     most_common_start = Counter(letter_start_count).most_common()
     most_common_letters = Counter(letter_counts).most_common()
-    print('Most common starting letter:', most_common_start)
-    print('Most common letters:', most_common_letters)
+    print("Most common starting letter:", most_common_start)
+    print("Most common letters:", most_common_letters)
 
     return most_common_start, most_common_letters, possible_words
 
@@ -114,7 +114,7 @@ def get_best_words(most_common_letters, possible_words):
         for letter in [possible_letter[0] for possible_letter in letter_probabilities]:
             # Toss out words that don't match verified letter positions
             for index, verified_letter in enumerate(VERIFIED_LETTERS):
-                if verified_letter != word[index] and verified_letter != '':
+                if verified_letter != word[index] and verified_letter != "":
                     word_failed = True
                     break
             for (
@@ -136,7 +136,7 @@ def get_best_words(most_common_letters, possible_words):
                 word_weight += letter_weights[letter[0]]
                 highest_ranking_words[word] = word_weight
 
-    print('Possible words:', possible_words_count)
+    print("Possible words:", possible_words_count)
 
     best_words = []
     for word, weight in sorted(
@@ -176,11 +176,11 @@ def get_best_guess(answer_list):
 
 
 def _read_file(filename):
-    with open(filename, 'r') as data:
+    with open(filename, "r") as data:
         word_list = json.load(data)
 
     return word_list
 
 
-if __name__ == '__main__':
+if __name__ == "__main__":
     main()
diff --git a/pyproject.toml b/pyproject.toml
@@ -1,7 +1,5 @@
 [tool.black]
-preview = true
 line-length = 120
-skip-string-normalization = true
 
 [tool.isort]
 profile = "black"
diff --git a/setup.py b/setup.py
diff --git a/test/unit/recursion/test_sudoku.py b/test/unit/recursion/test_sudoku.py
diff --git a/test/unit/sequences/test_fibonnaci_sequence.py b/test/unit/sequences/test_fibonnaci_sequence.py
diff --git a/test/unit/sequences/test_fizzbuzz.py b/test/unit/sequences/test_fizzbuzz.py
diff --git a/test/unit/sorting/test_wordle_solver.py b/test/unit/sorting/test_wordle_solver.py
