Sorting & Searching
Binary search, merge sort, quicksort & heaps
17 Problems
⌘K
#
Problem
Difficulty
Actions
01.
The N-th root of an integer
Medium
02.
Matrix Median
Medium
03.
Find the element that appears once in a sorted array, and the rest element appears twice
Medium
04.
Search element in a sorted and rotated array
Medium
05.
Median of 2 sorted arrays
Hard
06.
K-th element of two sorted arrays
Medium
07.
Allocate Minimum Number of Pages
Medium
08.
Aggressive Cows
Medium
09.
Max heap, Min Heap Implementation
Medium
10.
Kth Largest Element
Medium
11.
Maximum Sum Combination
Medium
12.
Find Median from Data Stream
Hard
13.
Find median in a stream of running integers
Hard
14.
K-th largest element in a stream
Easy
15.
K-th largest element in an unsorted array
Medium
16.
Merge K sorted arrays
Medium
17.
K most frequent elements
Medium