Algorithms
dynamic programming
26 problems
# | Title | Acceptance | Difficulty |
|---|---|---|---|
1 | array sorting recursion +3 more | 28.8% | Med. |
2 | binary tree depth-first search recursion +1 more | 38.3% | easy |
3 | binary tree tree depth first search recursion +2 more | 17.7% | hard |
4 | graph depth-first search breadth-first search +2 more | 64.2% | Med. |
5 | backtracking recursion string +2 more | 70.2% | hard |
6 | recursion divide and conquer dynamic programming | 67.4% | hard |
7 | binary search tree binary tree recursion +2 more | 30.1% | hard |
8 | binary search tree dynamic programming recursion +2 more | 34.4% | hard |
9 | greedy algorithm array sorting +1 more | 30.4% | Med. |
10 | dynamic programming recursion greedy algorithm +2 more | 42.7% | Med. |
11 | dynamic programming recursion subsets +1 more | 35.0% | Med. |
12 | dynamic programming recursion greedy algorithm +3 more | 50.7% | hard |
13 | subsets dynamic programming recursion +2 more | 55.6% | hard |
14 | dynamic programming recursion backtracking +1 more | 44.6% | hard |
15 | string backtracking recursion +2 more | 44.3% | Med. |
16 | string dynamic programming recursion +1 more | 53.0% | Med. |
17 | graph algorithms breadth-first search depth-first search +3 more | 40.8% | Med. |
18 | array prefix sum recursion +1 more | 67.0% | easy |
19 | dynamic programming array greedy algorithm +1 more | 22.2% | Med. |
20 | dynamic programming string matching array +1 more | 32.9% | Med. |
21 | dynamic programming array greedy algorithm +2 more | 20.2% | Med. |
22 | dynamic programming recursion string +1 more | 17.2% | Med. |
23 | dynamic programming recursion | 65.2% | Med. |
24 | dynamic programming recursion string +1 more | 40.7% | Med. |
25 | graph algorithms depth-first search breadth-first search +3 more | 30.7% | Med. |
26 | stack string breadth-first search +3 more | 15.7% | hard |