O(4^n / n^(3/2))
O(n)
Medium
O(O(k * C(n, k)))
O(k)
Medium
O(b^(d/2))
O(w * l)
Hard
CTCI
Bi-BFS
O(n^2) ~ O(2^n)
O(n^2)
Medium
O(n * l^2 + n * r)
O(n^2)
Hard
O(m * n * 3^h)
O(t)
Hard
LintCode
Trie, DFS
O(n * C(n - 1, c - 1))
O(n + c)
Hard
🔒
O(n + c^2)
O(c)
Medium
🔒
DP, Hash, Sprague-Grundy Theorem
_O((b+h) * h!*(b+h-1)!/(b-1)!)_
_O((b+h) * h!*(b+h-1)!/(b-1)!)_
Hard
Backtracking
O(n * 2^n)
O(n)
Medium
Backtracking
O(n * 2^n)
O(2^n)
Medium
DFS, DP, Memoization
O(m * n)
O(min(m, n))
Medium
DP, Hash, Binary Search
