Title
Solution
Time
Space
Difficulty
Tag
Note
O(n)
O(1)
Medium
CTCI, LintCode
BST, Heap
O(nlogn)
O(n)
Hard
EPI, LintCode
BST, Heap
O(n * k)
O(n + k)
Medium
BST, Heap
O(n)
O(c)
Hard
🔒
Greedy, Heap
O(k * log(min(n, m, k)))
O(min(n, m, k))
Medium
O(k * log(min(n, m, k)))
O(min(n, m, k))
Medium
LintCode
O(m * n * (logm + logn))
O(m * n)
Hard
LintCode
O(nlogk)
O(k)
Hard
BST, Heap
seat: O(logn) leave: O(logn)
O(n)
Medium
BST, Hash
