Commit12c7b60

authored

add problem for k-th statistic

Added leetcode 215 as a practice problem

1 parente65d837 commit12c7b60Copy full SHA for 12c7b60

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -72,5 +72,5 @@ T order_statistics (std::vector<T> a, unsigned n, unsigned k)`
`72`	`72`	`* 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.`
`73`	`73`
`74`	`74`	`## Practice Problems`
`75`		`-`
	`75`	`+- [Leetcode: Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/description/)`
`76`	`76`	`- [CODECHEF: Median](https://www.codechef.com/problems/CD1IT1)`

Comments

(0)