diff --git a/solutions/advanced/spoj-cot.mdx b/solutions/advanced/spoj-cot.mdx
index f9ebd099b8..b9349f4cfc 100644
--- a/solutions/advanced/spoj-cot.mdx
+++ b/solutions/advanced/spoj-cot.mdx
@@ -6,7 +6,6 @@ author: Nigar Hajiyeva
 ---
 ## Explanation
 
-This code solves the "Count on a Tree" problem using a persistent segment tree.
 In this code, a persistent segment tree is built for each node in the tree by modifying that of its parent.
 
 Each persistent segment tree keeps the frequency of numbers on the way from the root node to itself. When asked for the kth minimum node in the path of u to v, the code first determines the lowest common ancestor (LCA). Next, we run a binary search using the frequency values from the persistent segment tree of the three nodes.