-
Updated
Jan 17, 2020 - Swift
data-structures-algorithms
Here are 209 public repositories matching this topic...
-
Updated
Oct 31, 2020 - C++
-
Updated
Jun 29, 2019 - C++
-
Updated
Apr 21, 2020 - JavaScript
-
Updated
Sep 6, 2020 - C++
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,
-
Updated
Oct 18, 2020 - JavaScript
-
Updated
Nov 23, 2020 - HTML
-
Updated
Nov 21, 2020 - C++
-
Updated
Jul 30, 2020 - JavaScript
-
Updated
Oct 23, 2020 - Java
-
Updated
Dec 9, 2018 - Java
-
Updated
Jul 7, 2020 - C++
-
Updated
Sep 30, 2020 - C
-
Updated
Sep 30, 2020 - C++
-
Updated
Sep 6, 2020 - TypeScript
-
Updated
Oct 5, 2020 - Python
-
Updated
Nov 23, 2020 - C++
-
Updated
Sep 26, 2020 - Java
-
Updated
Sep 22, 2020 - TypeScript
-
Updated
Jul 6, 2020 - C
-
Updated
Jul 26, 2020 - Java
-
Updated
Oct 20, 2020 - Java
-
Updated
Apr 13, 2019 - C
-
Updated
Jan 4, 2018 - Java
-
Updated
Feb 19, 2019 - C++
-
Updated
Sep 10, 2020 - Python
Improve this page
Add a description, image, and links to the data-structures-algorithms topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the data-structures-algorithms topic, visit your repo's landing page and select "manage topics."
update README.md to give out more information about the repo.