diff --git a/divide_and_conquer/convex_hull.py b/divide_and_conquer/convex_hull.py
index 21463e62197d..d9cd6609ea1e 100644
--- a/divide_and_conquer/convex_hull.py
+++ b/divide_and_conquer/convex_hull.py
@@ -200,8 +200,7 @@ def _validate_input(points):
                 )
         elif not hasattr(points, "__iter__"):
             raise ValueError(
-                "Expecting an iterable object "
-                f"but got an non-iterable type {points}"
+                "Expecting an iterable object " f"but got an non-iterable type {points}"
             )
     except TypeError as e:
         print("Expecting an iterable of type Point, list or tuple.")
diff --git a/graphs/dijkstra_algorithm.py b/graphs/dijkstra_algorithm.py
index 57733eb5106d..7dfb5fb9df48 100644
--- a/graphs/dijkstra_algorithm.py
+++ b/graphs/dijkstra_algorithm.py
@@ -104,9 +104,7 @@ def show_graph(self):
         # u -> v(w)
         for u in self.adjList:
             print(
-                u,
-                "->",
-                " -> ".join(str(f"{v}({w})") for v, w in self.adjList[u]),
+                u, "->", " -> ".join(str(f"{v}({w})") for v, w in self.adjList[u]),
             )
 
     def dijkstra(self, src):
diff --git a/machine_learning/sequential_minimum_optimization.py b/machine_learning/sequential_minimum_optimization.py
index cb859602b29f..a98bd93f7a06 100644
--- a/machine_learning/sequential_minimum_optimization.py
+++ b/machine_learning/sequential_minimum_optimization.py
@@ -499,9 +499,7 @@ def test_cancel_data():
     for i in range(test_tags.shape[0]):
         if test_tags[i] == predict[i]:
             score += 1
-    print(
-        f"\r\nall: {test_num}\r\nright: {score}\r\nfalse: {test_num - score}"
-    )
+    print(f"\r\nall: {test_num}\r\nright: {score}\r\nfalse: {test_num - score}")
     print(f"Rough Accuracy: {score / test_tags.shape[0]}")