typo

gvnee · adamant-pwn · commit 2546479b9577 · 2023-04-14T17:24:37.000+02:00
diff --git a/src/data_structures/sparse-table.md b/src/data_structures/sparse-table.md
@@ -149,7 +149,7 @@ One of the main weakness of the $O(1)$ approach discussed in the previous sectio
 I.e. it works great for range minimum queries, but it is not possible to answer range sum queries using this approach.
 
 There are similar data structures that can handle any type of associative functions and answer range queries in $O(1)$.
-One of them is called is called [Disjoint Sparse Table](https://discuss.codechef.com/questions/117696/tutorial-disjoint-sparse-table).
+One of them is called [Disjoint Sparse Table](https://discuss.codechef.com/questions/117696/tutorial-disjoint-sparse-table).
 Another one would be the [Sqrt Tree](sqrt-tree.md).
 
 ## Practice Problems
