Binary Search
Given a sorted array of integers and a target value, return the index of the target if found, or -1 if not present.
Kth Largest Element in an Array
Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.
Median of Two Sorted Arrays
Given two sorted arrays nums1 and nums2, return the median of the two sorted arrays. The overall run time complexity should be O(log(min(m,n))).
Merge K Sorted Arrays
Merge k sorted arrays into one sorted array using heap
Search in Rotated Sorted Array
Given a rotated sorted array and a target value, return the index of the target if found in O(log n) time, or -1 if not present.