Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commitf3c64e8

Browse files
authored
Merge pull request#1375 from random1001guy/patch-1
add problem for k-th statistic
2 parentse65d837 +12c7b60 commitf3c64e8

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎src/sequences/k-th.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -72,5 +72,5 @@ T order_statistics (std::vector<T> a, unsigned n, unsigned k)
7272
* 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.
7373
7474
## Practice Problems
75-
75+
- [Leetcode: Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/description/)
7676
- [CODECHEF: Median](https://www.codechef.com/problems/CD1IT1)

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp