-
Updated
Oct 1, 2020 - Java
bst
Here are 269 public repositories matching this topic...
-
Updated
Jun 12, 2020 - Python
-
Updated
Sep 2, 2018 - C
-
Updated
Oct 3, 2020 - C++
-
Updated
Aug 10, 2020 - Python
-
Updated
Oct 3, 2020 - Python
-
Updated
Oct 16, 2020 - C
-
Updated
May 23, 2020 - HTML
-
Updated
Jul 28, 2020 - Python
-
Updated
Feb 21, 2018 - Python
Tell us about the technical questions you were asked for a particular company internship/FTE.
-
Updated
Sep 12, 2020 - JavaScript
-
Updated
Oct 22, 2020 - JavaScript
-
Updated
May 21, 2019 - C++
-
Updated
Jan 10, 2019 - JavaScript
-
Updated
Sep 21, 2020 - C++
-
Updated
Sep 30, 2017 - PHP
-
Updated
Sep 8, 2019 - C++
-
Updated
Feb 14, 2017 - C++
-
Updated
Aug 22, 2017 - JavaScript
-
Updated
Oct 22, 2020 - C++
-
Updated
Aug 20, 2020
-
Updated
Jul 22, 2020 - Go
-
Updated
Sep 14, 2020 - Python
-
Updated
May 11, 2017 - JavaScript
Improve this page
Add a description, image, and links to the bst topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the bst topic, visit your repo's landing page and select "manage topics."
Given an array A of random integers and an integer k, find and return the kth largest element in the array.
Try to do this question in less than O(nlogn) time.
Input Format :
Line 1 : An integer N i.e. size of the array
Line 2 : N integers which are elements of the array, separated by spaces
Line 3 : An integer k
Output Format :
kth largest element
Input Constraints :
1 <= N, Ai,