Merge branch 'cp-algorithms:main' into main

Proxihox · web-flow · commit dfc5b3e8af33 · 2025-02-04T15:47:04.000+05:30
diff --git a/src/graph/hld.md b/src/graph/hld.md
@@ -183,3 +183,8 @@ int query(int a, int b) {
 ## Practice problems
 
 - [SPOJ - QTREE - Query on a tree](https://www.spoj.com/problems/QTREE/)
+- [CSES - Path Queries II](https://cses.fi/problemset/task/2134)
+- [Codeforces - Subway Lines](https://codeforces.com/gym/101908/problem/L)
+- [Codeforces - Tree Queries](https://codeforces.com/contest/1254/problem/D)
+- [Codeforces - Tree or not Tree](https://codeforces.com/contest/117/problem/E)
+- [Codeforces - The Tree](https://codeforces.com/contest/1017/problem/G)
diff --git a/src/sequences/longest_increasing_subsequence.md b/src/sequences/longest_increasing_subsequence.md
@@ -300,7 +300,7 @@ This is in fact nearly the same problem.
 Only now it is allowed to use identical numbers in the subsequence.
 
 The solution is essentially also nearly the same.
-We just have to change the inequality signs, and make a slightly modification to the binary search.
+We just have to change the inequality signs, and make a slight modification to the binary search.
 
 ### Number of longest increasing subsequences
 
