Update Sliding.mdx

content/4_Silver/Sliding.mdx

@@ -59,7 +59,7 @@ Two pointers refers to iterating two monotonic pointers across an array to searc
 
 Let's envision a **sliding window** (or constant size subarray) of size $K$ moving left to right along an array, $a$. 
 
-For each position of the window, we want to compute some information. For example, we could store a `std::set` of integers representing the integers inside the window. If the window currently spans the range $i \dots j$, we observe that moving the range forward to $i+1 \dots j+1$ only removes $a_i$ and adds $a_{j+1}$ to the window. We can support these two operations and query for the minimum / maximum in the set in $O(\log N)$. 
+For each position of the window, we want to compute some information. For example, we could store an ordered set of integers representing the integers inside the window. If the window currently spans the range $i \dots j$, we observe that moving the range forward to $i+1 \dots j+1$ only removes $a_i$ and adds $a_{j+1}$ to the window. We can support these two operations and query for the minimum / maximum in the set in $O(\log N)$. 
 
 To compute the sum in the range, instead of using a set, we can store a variable $s$ representing the sum. As we move the window forward, we update $s$ by subtracting $a_i$ from $s$ and adding $a_{j+1}$ to $s$.