diff --git a/backtracking/hamiltonian_cycle.py b/backtracking/hamiltonian_cycle.py
index 4c6ae46799f4..4a4156d70b32 100644
--- a/backtracking/hamiltonian_cycle.py
+++ b/backtracking/hamiltonian_cycle.py
@@ -71,7 +71,7 @@ def util_hamilton_cycle(graph: list[list[int]], path: list[int], curr_ind: int)
     >>> curr_ind = 1
     >>> util_hamilton_cycle(graph, path, curr_ind)
     True
-    >>> print(path)
+    >>> path
     [0, 1, 2, 4, 3, 0]
 
     Case 2: Use exact graph as in previous case, but in the properties taken from
@@ -85,7 +85,7 @@ def util_hamilton_cycle(graph: list[list[int]], path: list[int], curr_ind: int)
     >>> curr_ind = 3
     >>> util_hamilton_cycle(graph, path, curr_ind)
     True
-    >>> print(path)
+    >>> path
     [0, 1, 2, 4, 3, 0]
     """
 
diff --git a/computer_vision/flip_augmentation.py b/computer_vision/flip_augmentation.py
index 1272357fd03e..93b4e3f6da79 100644
--- a/computer_vision/flip_augmentation.py
+++ b/computer_vision/flip_augmentation.py
@@ -22,7 +22,6 @@ def main() -> None:
     Get images list and annotations list from input dir.
     Update new images and annotations.
     Save images and annotations in output dir.
-    >>> pass  # A doctest is not possible for this function.
     """
     img_paths, annos = get_dataset(LABEL_DIR, IMAGE_DIR)
     print("Processing...")
@@ -48,7 +47,6 @@ def get_dataset(label_dir: str, img_dir: str) -> tuple[list, list]:
     - label_dir <type: str>: Path to label include annotation of images
     - img_dir <type: str>: Path to folder contain images
     Return <type: list>: List of images path and labels
-    >>> pass  # A doctest is not possible for this function.
     """
     img_paths = []
     labels = []
@@ -88,7 +86,6 @@ def update_image_and_anno(
         - new_imgs_list <type: narray>: image after resize
         - new_annos_lists <type: list>: list of new annotation after scale
         - path_list <type: list>: list the name of image file
-    >>> pass  # A doctest is not possible for this function.
     """
     new_annos_lists = []
     path_list = []
diff --git a/computer_vision/mosaic_augmentation.py b/computer_vision/mosaic_augmentation.py
index 4fd81957ce2a..e2953749753f 100644
--- a/computer_vision/mosaic_augmentation.py
+++ b/computer_vision/mosaic_augmentation.py
@@ -23,7 +23,6 @@ def main() -> None:
     Get images list and annotations list from input dir.
     Update new images and annotations.
     Save images and annotations in output dir.
-    >>> pass  # A doctest is not possible for this function.
     """
     img_paths, annos = get_dataset(LABEL_DIR, IMG_DIR)
     for index in range(NUMBER_IMAGES):
@@ -60,7 +59,6 @@ def get_dataset(label_dir: str, img_dir: str) -> tuple[list, list]:
     - label_dir <type: str>: Path to label include annotation of images
     - img_dir <type: str>: Path to folder contain images
     Return <type: list>: List of images path and labels
-    >>> pass  # A doctest is not possible for this function.
     """
     img_paths = []
     labels = []
@@ -105,7 +103,6 @@ def update_image_and_anno(
         - output_img <type: narray>: image after resize
         - new_anno <type: list>: list of new annotation after scale
         - path[0] <type: string>: get the name of image file
-    >>> pass  # A doctest is not possible for this function.
     """
     output_img = np.zeros([output_size[0], output_size[1], 3], dtype=np.uint8)
     scale_x = scale_range[0] + random.random() * (scale_range[1] - scale_range[0])
diff --git a/data_structures/binary_tree/avl_tree.py b/data_structures/binary_tree/avl_tree.py
index 320e7ed0d792..269fc173cf5c 100644
--- a/data_structures/binary_tree/avl_tree.py
+++ b/data_structures/binary_tree/avl_tree.py
@@ -248,12 +248,12 @@ class AVLtree:
     >>> t = AVLtree()
     >>> t.insert(4)
     insert:4
-    >>> print(str(t).replace(" \\n","\\n"))
+    >>> str(t).replace(" \\n","\\n")
      4
     *************************************
     >>> t.insert(2)
     insert:2
-    >>> print(str(t).replace(" \\n","\\n").replace(" \\n","\\n"))
+    >>> str(t).replace(" \\n","\\n").replace(" \\n","\\n")
       4
      2  *
     *************************************
@@ -261,7 +261,7 @@ class AVLtree:
     insert:3
     right rotation node: 2
     left rotation node: 4
-    >>> print(str(t).replace(" \\n","\\n").replace(" \\n","\\n"))
+    >>> str(t).replace(" \\n","\\n").replace(" \\n","\\n")
       3
      2  4
     *************************************
@@ -269,7 +269,7 @@ class AVLtree:
     2
     >>> t.del_node(3)
     delete:3
-    >>> print(str(t).replace(" \\n","\\n").replace(" \\n","\\n"))
+    >>> str(t).replace(" \\n","\\n").replace(" \\n","\\n")
       4
      2  *
     *************************************
diff --git a/data_structures/binary_tree/binary_search_tree.py b/data_structures/binary_tree/binary_search_tree.py
index fc60540a1f3b..6d440a3783af 100644
--- a/data_structures/binary_tree/binary_search_tree.py
+++ b/data_structures/binary_tree/binary_search_tree.py
@@ -190,9 +190,9 @@ def binary_search_tree() -> None:
 
     >>> t = BinarySearchTree()
     >>> t.insert(8, 3, 6, 1, 10, 14, 13, 4, 7)
-    >>> print(" ".join(repr(i.value) for i in t.traversal_tree()))
+    >>> " ".join(repr(i.value) for i in t.traversal_tree())
     8 3 1 6 4 7 10 14 13
-    >>> print(" ".join(repr(i.value) for i in t.traversal_tree(postorder)))
+    >>> " ".join(repr(i.value) for i in t.traversal_tree(postorder))
     1 4 7 6 3 13 14 10 8
     >>> BinarySearchTree().search(6)
     Traceback (most recent call last):
diff --git a/data_structures/heap/binomial_heap.py b/data_structures/heap/binomial_heap.py
index 334b444eaaff..26f934a3d1bd 100644
--- a/data_structures/heap/binomial_heap.py
+++ b/data_structures/heap/binomial_heap.py
@@ -71,7 +71,7 @@ class BinomialHeap:
     ...     first_heap.insert(number)
 
     Size test
-    >>> print(first_heap.size)
+    >>> first_heap.size
     30
 
     Deleting - delete() test
@@ -97,11 +97,11 @@ class BinomialHeap:
                   #    # #   #
 
     preOrder() test
-    >>> print(second_heap.preOrder())
+    >>> second_heap.preOrder()
     [(17, 0), ('#', 1), (31, 1), (20, 2), ('#', 3), ('#', 3), (34, 2), ('#', 3), ('#', 3)]
 
     printing Heap - __str__() test
-    >>> print(second_heap)
+    >>> second_heap
     17
     -#
     -31
diff --git a/data_structures/heap/heap.py b/data_structures/heap/heap.py
index 4c19747ec823..071790d18448 100644
--- a/data_structures/heap/heap.py
+++ b/data_structures/heap/heap.py
@@ -9,20 +9,20 @@ class Heap:
     >>> unsorted = [103, 9, 1, 7, 11, 15, 25, 201, 209, 107, 5]
     >>> h = Heap()
     >>> h.build_max_heap(unsorted)
-    >>> print(h)
+    >>> h
     [209, 201, 25, 103, 107, 15, 1, 9, 7, 11, 5]
     >>>
     >>> h.extract_max()
     209
-    >>> print(h)
+    >>> h
     [201, 107, 25, 103, 11, 15, 1, 9, 7, 5]
     >>>
     >>> h.insert(100)
-    >>> print(h)
+    >>> h
     [201, 107, 25, 103, 100, 15, 1, 9, 7, 5, 11]
     >>>
     >>> h.heap_sort()
-    >>> print(h)
+    >>> h
     [1, 5, 7, 9, 11, 15, 25, 100, 103, 107, 201]
     """
 
diff --git a/data_structures/heap/min_heap.py b/data_structures/heap/min_heap.py
index d8975eb2dcc7..3ad17068dca7 100644
--- a/data_structures/heap/min_heap.py
+++ b/data_structures/heap/min_heap.py
@@ -21,13 +21,13 @@ class MinHeap:
     >>> a = Node("A", 3)
     >>> x = Node("X", 1)
     >>> e = Node("E", 4)
-    >>> print(b)
+    >>> b
     Node(B, 6)
     >>> myMinHeap = MinHeap([r, b, a, x, e])
     >>> myMinHeap.decrease_key(b, -17)
-    >>> print(b)
+    >>> b
     Node(B, -17)
-    >>> print(myMinHeap["B"])
+    >>> myMinHeap["B"]
     -17
     """
 
diff --git a/data_structures/linked_list/__init__.py b/data_structures/linked_list/__init__.py
index 85660a6d2c27..c74a9ea7569e 100644
--- a/data_structures/linked_list/__init__.py
+++ b/data_structures/linked_list/__init__.py
@@ -46,7 +46,7 @@ def __str__(self) -> str:
         >>> linked_list.add(23)
         >>> linked_list.add(14)
         >>> linked_list.add(9)
-        >>> print(linked_list)
+        >>> linked_list
         9 --> 14 --> 23
         """
         if not self.is_empty:
diff --git a/data_structures/linked_list/skip_list.py b/data_structures/linked_list/skip_list.py
index a667e3e9bc84..bc9b3507f4b2 100644
--- a/data_structures/linked_list/skip_list.py
+++ b/data_structures/linked_list/skip_list.py
@@ -59,16 +59,16 @@ def __str__(self) -> str:
         :return: Visual representation of SkipList
 
         >>> skip_list = SkipList()
-        >>> print(skip_list)
+        >>> skip_list
         SkipList(level=0)
         >>> skip_list.insert("Key1", "Value")
-        >>> print(skip_list) # doctest: +ELLIPSIS
+        >>> skip_list # doctest: +ELLIPSIS
         SkipList(level=...
         [root]--...
         [Key1]--Key1...
         None    *...
         >>> skip_list.insert("Key2", "OtherValue")
-        >>> print(skip_list) # doctest: +ELLIPSIS
+        >>> skip_list # doctest: +ELLIPSIS
         SkipList(level=...
         [root]--...
         [Key1]--Key1...
diff --git a/data_structures/queue/priority_queue_using_list.py b/data_structures/queue/priority_queue_using_list.py
index c5cf26433fff..53a1105a402c 100644
--- a/data_structures/queue/priority_queue_using_list.py
+++ b/data_structures/queue/priority_queue_using_list.py
@@ -30,7 +30,7 @@ class FixedPriorityQueue:
     >>> fpq.enqueue(2, 4)
     >>> fpq.enqueue(1, 64)
     >>> fpq.enqueue(0, 128)
-    >>> print(fpq)
+    >>> fpq
     Priority 0: [10, 100, 128]
     Priority 1: [70, 7, 64]
     Priority 2: [1, 5, 4]
@@ -44,7 +44,7 @@ class FixedPriorityQueue:
     70
     >>> fpq.dequeue()
     7
-    >>> print(fpq)
+    >>> fpq
     Priority 0: []
     Priority 1: [64]
     Priority 2: [1, 5, 4]
@@ -60,7 +60,7 @@ class FixedPriorityQueue:
     Traceback (most recent call last):
     ...
     data_structures.queue.priority_queue_using_list.UnderFlowError: All queues are empty
-    >>> print(fpq)
+    >>> fpq
     Priority 0: []
     Priority 1: []
     Priority 2: []
@@ -116,7 +116,7 @@ class ElementPriorityQueue:
     >>> epq.enqueue(4)
     >>> epq.enqueue(64)
     >>> epq.enqueue(128)
-    >>> print(epq)
+    >>> epq
     [10, 70, 4, 1, 5, 7, 4, 64, 128]
     >>> epq.dequeue()
     1
@@ -130,7 +130,7 @@ class ElementPriorityQueue:
     7
     >>> epq.dequeue()
     10
-    >>> print(epq)
+    >>> epq
     [70, 64, 128]
     >>> epq.dequeue()
     64
@@ -142,7 +142,7 @@ class ElementPriorityQueue:
     Traceback (most recent call last):
         ...
     data_structures.queue.priority_queue_using_list.UnderFlowError: The queue is empty
-    >>> print(epq)
+    >>> epq
     []
     """
 
diff --git a/graphs/gale_shapley_bigraph.py b/graphs/gale_shapley_bigraph.py
index 56b8c6c77bcb..f4b3153817c4 100644
--- a/graphs/gale_shapley_bigraph.py
+++ b/graphs/gale_shapley_bigraph.py
@@ -17,7 +17,7 @@ def stable_matching(
 
     >>> donor_pref = [[0, 1, 3, 2], [0, 2, 3, 1], [1, 0, 2, 3], [0, 3, 1, 2]]
     >>> recipient_pref = [[3, 1, 2, 0], [3, 1, 0, 2], [0, 3, 1, 2], [1, 0, 3, 2]]
-    >>> print(stable_matching(donor_pref, recipient_pref))
+    >>> stable_matching(donor_pref, recipient_pref)
     [1, 2, 3, 0]
     """
     assert len(donor_pref) == len(recipient_pref)
diff --git a/graphs/graph_list.py b/graphs/graph_list.py
index f04b7a92390d..ec81528a58a5 100644
--- a/graphs/graph_list.py
+++ b/graphs/graph_list.py
@@ -26,9 +26,9 @@ class GraphAdjacencyList(Generic[T]):
     {0: [1], 1: [2, 4, 5], 2: [], 4: [], 5: []}
     >>> d_graph.add_edge(2, 0).add_edge(2, 6).add_edge(2, 7)
     {0: [1], 1: [2, 4, 5], 2: [0, 6, 7], 4: [], 5: [], 6: [], 7: []}
-    >>> print(d_graph)
+    >>> d_graph
     {0: [1], 1: [2, 4, 5], 2: [0, 6, 7], 4: [], 5: [], 6: [], 7: []}
-    >>> print(repr(d_graph))
+    >>> repr(d_graph)
     {0: [1], 1: [2, 4, 5], 2: [0, 6, 7], 4: [], 5: [], 6: [], 7: []}
 
     Undirected graph example:
@@ -47,7 +47,7 @@ class GraphAdjacencyList(Generic[T]):
      5: [1, 4],
      6: [2],
      7: [2]}
-    >>> print(u_graph)
+    >>> u_graph
     {0: [1, 2],
      1: [0, 2, 4, 5],
      2: [1, 0, 6, 7],
@@ -55,7 +55,7 @@ class GraphAdjacencyList(Generic[T]):
      5: [1, 4],
      6: [2],
      7: [2]}
-    >>> print(repr(u_graph))
+    >>> repr(u_graph)
     {0: [1, 2],
      1: [0, 2, 4, 5],
      2: [1, 0, 6, 7],
@@ -68,7 +68,7 @@ class GraphAdjacencyList(Generic[T]):
      {'a': ['b'], 'b': ['a']}
      >>> char_graph.add_edge('b', 'c').add_edge('b', 'e').add_edge('b', 'f')
      {'a': ['b'], 'b': ['a', 'c', 'e', 'f'], 'c': ['b'], 'e': ['b'], 'f': ['b']}
-     >>> print(char_graph)
+     >>> char_graph
      {'a': ['b'], 'b': ['a', 'c', 'e', 'f'], 'c': ['b'], 'e': ['b'], 'f': ['b']}
     """
 
diff --git a/graphs/minimum_spanning_tree_boruvka.py b/graphs/minimum_spanning_tree_boruvka.py
index 6c72615cc729..036fd2dd249c 100644
--- a/graphs/minimum_spanning_tree_boruvka.py
+++ b/graphs/minimum_spanning_tree_boruvka.py
@@ -154,7 +154,7 @@ def boruvka_mst(graph):
         >>> g = Graph.build([0, 1, 2, 3], [[0, 1, 1], [0, 2, 1],[2, 3, 1]])
         >>> g.distinct_weight()
         >>> bg = Graph.boruvka_mst(g)
-        >>> print(bg)
+        >>> bg
         1 -> 0 == 1
         2 -> 0 == 2
         0 -> 1 == 1
diff --git a/graphs/minimum_spanning_tree_prims2.py b/graphs/minimum_spanning_tree_prims2.py
index d924ee3db1e5..707be783d087 100644
--- a/graphs/minimum_spanning_tree_prims2.py
+++ b/graphs/minimum_spanning_tree_prims2.py
@@ -69,16 +69,16 @@ class MinPriorityQueue(Generic[T]):
     >>> queue.push(3, 4000)
     >>> queue.push(4, 3000)
 
-    >>> print(queue.extract_min())
+    >>> queue.extract_min()
     2
 
     >>> queue.update_key(4, 50)
 
-    >>> print(queue.extract_min())
+    >>> queue.extract_min()
     4
-    >>> print(queue.extract_min())
+    >>> queue.extract_min()
     1
-    >>> print(queue.extract_min())
+    >>> queue.extract_min()
     3
     """
 
diff --git a/graphs/random_graph_generator.py b/graphs/random_graph_generator.py
index 15ccee5b399c..0e7e18bc8fd9 100644
--- a/graphs/random_graph_generator.py
+++ b/graphs/random_graph_generator.py
@@ -53,7 +53,7 @@ def complete_graph(vertices_number: int) -> dict:
     @input: vertices_number (number of vertices),
             directed (False if the graph is undirected, True otherwise)
     @example:
-    >>> print(complete_graph(3))
+    >>> complete_graph(3)
     {0: [1, 2], 1: [0, 2], 2: [0, 1]}
     """
     return {
diff --git a/linear_algebra/src/polynom_for_points.py b/linear_algebra/src/polynom_for_points.py
index 091849542ffe..fa609b991608 100644
--- a/linear_algebra/src/polynom_for_points.py
+++ b/linear_algebra/src/polynom_for_points.py
@@ -3,25 +3,25 @@ def points_to_polynomial(coordinates: list[list[int]]) -> str:
     coordinates is a two dimensional matrix: [[x, y], [x, y], ...]
     number of points you want to use
 
-    >>> print(points_to_polynomial([]))
+    >>> points_to_polynomial([])
     The program cannot work out a fitting polynomial.
-    >>> print(points_to_polynomial([[]]))
+    >>> points_to_polynomial([[]])
     The program cannot work out a fitting polynomial.
-    >>> print(points_to_polynomial([[1, 0], [2, 0], [3, 0]]))
+    >>> points_to_polynomial([[1, 0], [2, 0], [3, 0]])
     f(x)=x^2*0.0+x^1*-0.0+x^0*0.0
-    >>> print(points_to_polynomial([[1, 1], [2, 1], [3, 1]]))
+    >>> points_to_polynomial([[1, 1], [2, 1], [3, 1]])
     f(x)=x^2*0.0+x^1*-0.0+x^0*1.0
-    >>> print(points_to_polynomial([[1, 3], [2, 3], [3, 3]]))
+    >>> points_to_polynomial([[1, 3], [2, 3], [3, 3]])
     f(x)=x^2*0.0+x^1*-0.0+x^0*3.0
-    >>> print(points_to_polynomial([[1, 1], [2, 2], [3, 3]]))
+    >>> points_to_polynomial([[1, 1], [2, 2], [3, 3]])
     f(x)=x^2*0.0+x^1*1.0+x^0*0.0
-    >>> print(points_to_polynomial([[1, 1], [2, 4], [3, 9]]))
+    >>> points_to_polynomial([[1, 1], [2, 4], [3, 9]])
     f(x)=x^2*1.0+x^1*-0.0+x^0*0.0
-    >>> print(points_to_polynomial([[1, 3], [2, 6], [3, 11]]))
+    >>> points_to_polynomial([[1, 3], [2, 6], [3, 11]])
     f(x)=x^2*1.0+x^1*-0.0+x^0*2.0
-    >>> print(points_to_polynomial([[1, -3], [2, -6], [3, -11]]))
+    >>> points_to_polynomial([[1, -3], [2, -6], [3, -11]])
     f(x)=x^2*-1.0+x^1*-0.0+x^0*-2.0
-    >>> print(points_to_polynomial([[1, 5], [2, 2], [3, 9]]))
+    >>> points_to_polynomial([[1, 5], [2, 2], [3, 9]])
     f(x)=x^2*5.0+x^1*-18.0+x^0*18.0
     """
     try:
diff --git a/machine_learning/local_weighted_learning/local_weighted_learning.py b/machine_learning/local_weighted_learning/local_weighted_learning.py
index 6c542ab825aa..df03fe0a178d 100644
--- a/machine_learning/local_weighted_learning/local_weighted_learning.py
+++ b/machine_learning/local_weighted_learning/local_weighted_learning.py
@@ -71,7 +71,6 @@ def local_weight_regression(
 def load_data(dataset_name: str, cola_name: str, colb_name: str) -> np.mat:
     """
     Function used for loading data from the seaborn splitting into x and y points
-    >>> pass # this function has no doctest
     """
     import seaborn as sns
 
@@ -112,7 +111,6 @@ def plot_preds(
 ) -> plt.plot:
     """
     This function used to plot predictions and display the graph
-    >>> pass #this function has no doctest
     """
     xsort = training_data_x.copy()
     xsort.sort(axis=0)
diff --git a/machine_learning/xgboost_classifier.py b/machine_learning/xgboost_classifier.py
index bb5b48b7ab23..62a1b331baaf 100644
--- a/machine_learning/xgboost_classifier.py
+++ b/machine_learning/xgboost_classifier.py
@@ -2,7 +2,7 @@
 import numpy as np
 from matplotlib import pyplot as plt
 from sklearn.datasets import load_iris
-from sklearn.metrics import plot_confusion_matrix
+from sklearn.metrics import ConfusionMatrixDisplay
 from sklearn.model_selection import train_test_split
 from xgboost import XGBClassifier
 
@@ -63,7 +63,7 @@ def main() -> None:
     xgboost_classifier = xgboost(x_train, y_train)
 
     # Display the confusion matrix of the classifier with both training and test sets
-    plot_confusion_matrix(
+    ConfusionMatrixDisplay.from_estimator(
         xgboost_classifier,
         x_test,
         y_test,
diff --git a/maths/polynomial_evaluation.py b/maths/polynomial_evaluation.py
index 8ee82467efa1..90a51f521e01 100644
--- a/maths/polynomial_evaluation.py
+++ b/maths/polynomial_evaluation.py
@@ -45,7 +45,7 @@ def horner(poly: Sequence[float], x: float) -> float:
     >>> poly = (0.0, 0.0, 5.0, 9.3, 7.0)  # f(x) = 7.0x^4 + 9.3x^3 + 5.0x^2
     >>> x = -13.0
     >>> # f(-13) = 7.0(-13)^4 + 9.3(-13)^3 + 5.0(-13)^2 = 180339.9
-    >>> print(evaluate_poly(poly, x))
+    >>> evaluate_poly(poly, x)
     180339.9
     """
     poly = (0.0, 0.0, 5.0, 9.3, 7.0)
diff --git a/maths/pythagoras.py b/maths/pythagoras.py
index 69a17731a0fd..441e994c7910 100644
--- a/maths/pythagoras.py
+++ b/maths/pythagoras.py
@@ -21,7 +21,7 @@ def test_distance() -> None:
     """
     >>> point1 = Point(2, -1, 7)
     >>> point2 = Point(1, -3, 5)
-    >>> print(f"Distance from {point1} to {point2} is {distance(point1, point2)}")
+    >>> f"Distance from {point1} to {point2} is {distance(point1, point2}")
     Distance from Point(2, -1, 7) to Point(1, -3, 5) is 3.0
     """
     pass
diff --git a/maths/radix2_fft.py b/maths/radix2_fft.py
index 52442134de59..c8248e75ca64 100644
--- a/maths/radix2_fft.py
+++ b/maths/radix2_fft.py
@@ -39,11 +39,11 @@ class FFT:
     >>> x = FFT(A, B)
 
     Print product
-    >>> print(x.product)  # 2x + 3x^2 + 8x^3 + 4x^4 + 6x^5
+    >>> x.product  # 2x + 3x^2 + 8x^3 + 4x^4 + 6x^5
     [(-0+0j), (2+0j), (3+0j), (8+0j), (6+0j), (8+0j)]
 
     __str__ test
-    >>> print(x)
+    >>> x
     A = 0*x^0 + 1*x^1 + 2*x^0 + 3*x^2
     B = 0*x^2 + 1*x^3 + 2*x^4
     A*B = 0*x^(-0+0j) + 1*x^(2+0j) + 2*x^(3+0j) + 3*x^(8+0j) + 4*x^(6+0j) + 5*x^(8+0j)
diff --git a/matrix/matrix_class.py b/matrix/matrix_class.py
index 8b6fefa2124b..a821e7aff5f1 100644
--- a/matrix/matrix_class.py
+++ b/matrix/matrix_class.py
@@ -15,15 +15,15 @@ class Matrix:
     ...     [7, 8, 9]
     ... ]
     >>> matrix = Matrix(rows)
-    >>> print(matrix)
+    >>> matrix
     [[1. 2. 3.]
      [4. 5. 6.]
      [7. 8. 9.]]
 
     Matrix rows and columns are available as 2D arrays
-    >>> print(matrix.rows)
+    >>> matrix.rows
     [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
-    >>> print(matrix.columns())
+    >>> matrix.columns()
     [[1, 4, 7], [2, 5, 8], [3, 6, 9]]
 
     Order is returned as a tuple
@@ -38,24 +38,24 @@ class Matrix:
 
     Identity, Minors, Cofactors and Adjugate are returned as Matrices.  Inverse can be
     a Matrix or Nonetype
-    >>> print(matrix.identity())
+    >>> matrix.identity()
     [[1. 0. 0.]
      [0. 1. 0.]
      [0. 0. 1.]]
-    >>> print(matrix.minors())
+    >>> matrix.minors()
     [[-3. -6. -3.]
      [-6. -12. -6.]
      [-3. -6. -3.]]
-    >>> print(matrix.cofactors())
+    >>> matrix.cofactors()
     [[-3. 6. -3.]
      [6. -12. 6.]
      [-3. 6. -3.]]
     >>>  # won't be apparent due to the nature of the cofactor matrix
-    >>> print(matrix.adjugate())
+    >>> matrix.adjugate()
     [[-3. 6. -3.]
      [6. -12. 6.]
      [-3. 6. -3.]]
-    >>> print(matrix.inverse())
+    >>> matrix.inverse()
     Traceback (most recent call last):
         ...
     TypeError: Only matrices with a non-zero determinant have an inverse
@@ -66,41 +66,41 @@ class Matrix:
 
     Negation, scalar multiplication, addition, subtraction, multiplication and
     exponentiation are available and all return a Matrix
-    >>> print(-matrix)
+    >>> -matrix
     [[-1. -2. -3.]
      [-4. -5. -6.]
      [-7. -8. -9.]]
     >>> matrix2 = matrix * 3
-    >>> print(matrix2)
+    >>> matrix2
     [[3. 6. 9.]
      [12. 15. 18.]
      [21. 24. 27.]]
-    >>> print(matrix + matrix2)
+    >>> matrix + matrix2
     [[4. 8. 12.]
      [16. 20. 24.]
      [28. 32. 36.]]
-    >>> print(matrix - matrix2)
+    >>> matrix - matrix2
     [[-2. -4. -6.]
      [-8. -10. -12.]
      [-14. -16. -18.]]
-    >>> print(matrix ** 3)
+    >>> matrix ** 3
     [[468. 576. 684.]
      [1062. 1305. 1548.]
      [1656. 2034. 2412.]]
 
     Matrices can also be modified
     >>> matrix.add_row([10, 11, 12])
-    >>> print(matrix)
+    >>> matrix
     [[1. 2. 3.]
      [4. 5. 6.]
      [7. 8. 9.]
      [10. 11. 12.]]
     >>> matrix2.add_column([8, 16, 32])
-    >>> print(matrix2)
+    >>> matrix2
     [[3. 6. 9. 8.]
      [12. 15. 18. 16.]
      [21. 24. 27. 32.]]
-    >>> print(matrix *  matrix2)
+    >>> matrix *  matrix2
     [[90. 108. 126. 136.]
      [198. 243. 288. 304.]
      [306. 378. 450. 472.]
diff --git a/searches/simple_binary_search.py b/searches/simple_binary_search.py
index d1f7f7a51cbc..ff043d7369af 100644
--- a/searches/simple_binary_search.py
+++ b/searches/simple_binary_search.py
@@ -13,25 +13,25 @@
 def binary_search(a_list: list[int], item: int) -> bool:
     """
     >>> test_list = [0, 1, 2, 8, 13, 17, 19, 32, 42]
-    >>> print(binary_search(test_list, 3))
+    >>> binary_search(test_list, 3)
     False
-    >>> print(binary_search(test_list, 13))
+    >>> binary_search(test_list, 13)
     True
-    >>> print(binary_search([4, 4, 5, 6, 7], 4))
+    >>> binary_search([4, 4, 5, 6, 7], 4)
     True
-    >>> print(binary_search([4, 4, 5, 6, 7], -10))
+    >>> binary_search([4, 4, 5, 6, 7], -10)
     False
-    >>> print(binary_search([-18, 2], -18))
+    >>> binary_search([-18, 2], -18)
     True
-    >>> print(binary_search([5], 5))
+    >>> binary_search([5], 5)
     True
-    >>> print(binary_search(['a', 'c', 'd'], 'c'))
+    >>> binary_search(['a', 'c', 'd'], 'c')
     True
-    >>> print(binary_search(['a', 'c', 'd'], 'f'))
+    >>> binary_search(['a', 'c', 'd'], 'f')
     False
-    >>> print(binary_search([], 1))
+    >>> binary_search([], 1)
     False
-    >>> print(binary_search([-.1, .1 , .8], .1))
+    >>> binary_search([-.1, .1 , .8], .1)
     True
     >>> binary_search(range(-5000, 5000, 10), 80)
     True
diff --git a/sorts/bitonic_sort.py b/sorts/bitonic_sort.py
index 201fecd2ce86..b65f877a45e3 100644
--- a/sorts/bitonic_sort.py
+++ b/sorts/bitonic_sort.py
@@ -16,19 +16,19 @@ def comp_and_swap(array: list[int], index1: int, index2: int, direction: int) ->
 
     >>> arr = [12, 42, -21, 1]
     >>> comp_and_swap(arr, 1, 2, 1)
-    >>> print(arr)
+    >>> arr
     [12, -21, 42, 1]
 
     >>> comp_and_swap(arr, 1, 2, 0)
-    >>> print(arr)
+    >>> arr
     [12, 42, -21, 1]
 
     >>> comp_and_swap(arr, 0, 3, 1)
-    >>> print(arr)
+    >>> arr
     [1, 42, -21, 12]
 
     >>> comp_and_swap(arr, 0, 3, 0)
-    >>> print(arr)
+    >>> arr
     [12, 42, -21, 1]
     """
     if (direction == 1 and array[index1] > array[index2]) or (
@@ -46,11 +46,11 @@ def bitonic_merge(array: list[int], low: int, length: int, direction: int) -> No
 
     >>> arr = [12, 42, -21, 1]
     >>> bitonic_merge(arr, 0, 4, 1)
-    >>> print(arr)
+    >>> arr
     [-21, 1, 12, 42]
 
     >>> bitonic_merge(arr, 0, 4, 0)
-    >>> print(arr)
+    >>> arr
     [42, 12, 1, -21]
     """
     if length > 1:
diff --git a/sorts/normal_distribution_quick_sort.md b/sorts/normal_distribution_quick_sort.md
index c073f2cbc81c..27aca340fb3b 100644
--- a/sorts/normal_distribution_quick_sort.md
+++ b/sorts/normal_distribution_quick_sort.md
@@ -17,8 +17,8 @@ The array elements are taken from a Standard Normal Distribution, having mean =
 >>> mu, sigma = 0, 1 # mean and standard deviation
 >>> X = np.random.normal(mu, sigma, p)
 >>> np.save(outfile, X)
->>> print('The array is')
->>> print(X)
+>>> 'The array is'
+>>> X
 
 ```
 
diff --git a/sorts/recursive_insertion_sort.py b/sorts/recursive_insertion_sort.py
index ab2716f8eae5..297dbe9457e6 100644
--- a/sorts/recursive_insertion_sort.py
+++ b/sorts/recursive_insertion_sort.py
@@ -14,17 +14,17 @@ def rec_insertion_sort(collection: list, n: int):
 
     >>> col = [1, 2, 1]
     >>> rec_insertion_sort(col, len(col))
-    >>> print(col)
+    >>> col
     [1, 1, 2]
 
     >>> col = [2, 1, 0, -1, -2]
     >>> rec_insertion_sort(col, len(col))
-    >>> print(col)
+    >>> col
     [-2, -1, 0, 1, 2]
 
     >>> col = [1]
     >>> rec_insertion_sort(col, len(col))
-    >>> print(col)
+    >>> col
     [1]
     """
     # Checks if the entire collection has been sorted
@@ -41,17 +41,17 @@ def insert_next(collection: list, index: int):
 
     >>> col = [3, 2, 4, 2]
     >>> insert_next(col, 1)
-    >>> print(col)
+    >>> col
     [2, 3, 4, 2]
 
     >>> col = [3, 2, 3]
     >>> insert_next(col, 2)
-    >>> print(col)
+    >>> col
     [3, 2, 3]
 
     >>> col = []
     >>> insert_next(col, 1)
-    >>> print(col)
+    >>> col
     []
     """
     # Checks order between adjacent elements
diff --git a/web_programming/reddit.py b/web_programming/reddit.py
index 672109f1399d..6a31c81c34bd 100644
--- a/web_programming/reddit.py
+++ b/web_programming/reddit.py
@@ -23,8 +23,6 @@ def get_subreddit_data(
     limit : Number of posts to fetch
     age : ["new", "top", "hot"]
     wanted_data : Get only the required data in the list
-
-    >>> pass
     """
     wanted_data = wanted_data or []
     if invalid_search_terms := ", ".join(sorted(set(wanted_data) - valid_terms)):
diff --git a/web_programming/search_books_by_isbn.py b/web_programming/search_books_by_isbn.py
index 22a31dcb1db4..abac3c70b22e 100644
--- a/web_programming/search_books_by_isbn.py
+++ b/web_programming/search_books_by_isbn.py
@@ -19,7 +19,6 @@ def get_openlibrary_data(olid: str = "isbn/0140328726") -> dict:
     {'publishers': ['Puffin'], 'number_of_pages': 96, 'isbn_10': ['0140328726'], ...
     # >>> get_openlibrary_data(olid='/authors/OL7353617A')  # doctest: +ELLIPSIS
     {'name': 'Adrian Brisku', 'created': {'type': '/type/datetime', ...
-    >>> pass  # Placate https://github.com/apps/algorithms-keeper
     """
     new_olid = olid.strip().strip("/")  # Remove leading/trailing whitespace & slashes
     if new_olid.count("/") != 1:
@@ -29,9 +28,7 @@ def get_openlibrary_data(olid: str = "isbn/0140328726") -> dict:
 
 def summarize_book(ol_book_data: dict) -> dict:
     """
-     Given Open Library book data, return a summary as a Python dict.
-
-    >>> pass  # Placate https://github.com/apps/algorithms-keeper
+    Given Open Library book data, return a summary as a Python dict.
     """
     desired_keys = {
         "title": "Title",