Two sumarrow-up-right
O(NlogN) Sort + Two pointer
O(N) Hashmap
Kth largest element in an arrayarrow-up-right
O(NlogK) Heap
O(N) average Quicksort
K-way mergearrow-up-right
O(NKlogK) Divide and conquer
O(NKlogK) Heap
Maximum subarrayarrow-up-right
O(N²) Presum
O(NlogN) Divide and conquer
O(N) DP
Longest increasing subsequence (LIS)arrow-up-right
O(N²) DP
O(NlogN) Binary search
Longest palindrome substringarrow-up-right
O(N²) Expand from center
Last updated 4 years ago