Title
Solution
Time
Space
Difficulty
Tag
Note
O(n^2)
O(n)
Medium
Cantor Ordering
O(1)
O(1)
Hard
CTCI, LintCode
O(logn)
O(1)
Medium
Tricky, DP
O(logn)
O(1)
Medium
Bézout's identity
ctor: O(n)getRandom: O(1)
O(n)
Medium
Reservoir Sampling
ctor: O(n)pick: O(1)
O(n)
Medium
Reservoir Sampling
, Hash Table
O(nlogn)
O(1)
Easy
Binary Search
O(logn * log(logn))
O(1)
Hard
Math
ctor: O(n) pick: O(logn)
O(n)
Medium
ctor: O(1) pick: O(1) reset: O(n)
O(n)
Medium
ctor: O(n) pick: O(logn)
O(n)
Medium
O(sqrt(c) * logc)
O(1)
Easy
O(log(max(m, n)))
O(1)
Hard
O(sqrt(n))
O(1)
Hard
Factorization
O(n^(1/2) * (logn + n^(1/2)))
O(logn)
Medium
O(n^0.25 * logn)
O(logn)
Hard
O(n^2) ~ O(n^3)
O(n^2)
Medium