Algorithms
dynamic programming
23 problems
# | Title | Acceptance | Difficulty |
|---|---|---|---|
1 | binary tree depth-first search recursion +1 more | 38.2% | easy |
2 | binary tree tree depth first search recursion +2 more | 17.7% | hard |
3 | graph depth-first search breadth-first search +2 more | 64.2% | Med. |
4 | recursion divide and conquer string +1 more | 67.4% | hard |
5 | binary search tree recursion dynamic programming +2 more | 30.0% | hard |
6 | binary search tree dynamic programming recursion +2 more | 34.3% | hard |
7 | greedy algorithm array sorting +1 more | 30.4% | Med. |
8 | 0/1 knapsack dynamic programming recursion +3 more | 43.9% | Med. |
9 | dynamic programming 0/1 knapsack subsets +3 more | 42.8% | Med. |
10 | 0/1 knapsack dynamic programming array +2 more | 35.0% | Med. |
11 | dynamic programming 0/1 knapsack subsets +2 more | 50.7% | hard |
12 | subsets dynamic programming 0/1 knapsack +2 more | 55.6% | hard |
13 | dynamic programming subsets recursion +1 more | 44.6% | hard |
14 | string dynamic programming recursion +1 more | 53.0% | Med. |
15 | array prefix sum recursion +1 more | 67.0% | easy |
16 | dynamic programming array greedy algorithm +1 more | 22.2% | Med. |
17 | string two pointers dynamic programming | 33.0% | Med. |
18 | dynamic programming array greedy algorithm +2 more | 20.2% | Med. |
19 | dynamic programming recursion string +1 more | 17.2% | Med. |
20 | dynamic programming matrix traversal recursion +2 more | 65.4% | Med. |
21 | dynamic programming string recursion +3 more | 40.7% | Med. |
22 | graph algorithms depth-first search breadth-first search +3 more | 30.7% | Med. |
23 | stack string breadth-first search +3 more | 15.7% | hard |