Title
Solution
Time
Space
Difficulty
Tag
Note
O((m + n) * k)
O(n * k)
Hard
O(n)
O(n)
Easy
Linear Sieve of Eratosthenes
ctor: O(n), lookup: O(a + b)
O(n)
Medium
🔒
ctor: O(n), lookup: O(1)
O(k)
Easy
🔒
O(k)
O(k)
Hard
LintCode, 🔒
Union Find
O(n)
O(n)
Medium
🔒
Union Find
O(n)
O(n)
Medium
🔒
Hash, Two Pointers
O(n * s * 2^n)
O(n * (2^n + s))
Medium
O((m + n) * l)
O(m * l)
Easy
O(nlogn)
O(n)
Medium
Union Find
O(n + p)
O(p)
Medium
Union Find
O(nlogn)
O(n)
Hard
Math, Fast Wavelet Transform (FWT)