Merge pull request #1375 from random1001guy/patch-1

mhayter · web-flow · commit f3c64e82c9c3 · 2024-10-20T15:57:31.000-04:00
add problem for k-th statistic
diff --git a/src/sequences/k-th.md b/src/sequences/k-th.md
@@ -72,5 +72,5 @@ T order_statistics (std::vector<T> a, unsigned n, unsigned k)
 * Finding $K$ smallest elements can be reduced to finding $K$-th element with a linear overhead, as they're exactly the elements that are smaller than $K$-th.
 
 ## Practice Problems
-
+- [Leetcode: Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/description/)
 - [CODECHEF: Median](https://www.codechef.com/problems/CD1IT1)
