diff --git a/data_structures/dsu_path_compression.cpp b/data_structures/dsu_path_compression.cpp
index 8e0f7b123..d71bb6ac3 100644
--- a/data_structures/dsu_path_compression.cpp
+++ b/data_structures/dsu_path_compression.cpp
@@ -2,7 +2,7 @@
  * @file
  * @brief [DSU (Disjoint sets)](https://en.wikipedia.org/wiki/Disjoint-set-data_structure)
  * @details
- * DSU: It is a very powerful data structure that keeps track of different
+ * It is a very powerful data structure that keeps track of different
  * clusters(sets) of elements, these sets are disjoint(doesnot have a common element).
  * Disjoint sets uses cases : for finding connected components in a graph,
  * used in Kruskal's algorithm for finding Minimum Spanning tree.