dynamic programming Problems

Algorithms

dynamic programming

26 problems

#	Title	Acceptance	Difficulty
1	Valid Anagram (easy) string hash map sorting +2 more	38.4%	easy
2	Problem Challenge 2: Find the Smallest Missing Positive Number (medium) array sorting recursion +3 more	28.9%	Med.
3	Count Paths for a Sum (medium) binary tree recursion depth-first search +2 more	24.5%	Med.
4	Problem Challenge 1: Evaluate Expression (hard) recursion divide and conquer dynamic programming	67.2%	hard
5	Problem Challenge 2: Structurally Unique Binary Search Trees (hard) binary tree binary search tree recursion +2 more	30.1%	hard
6	Problem Challenge 3: Count of Structurally Unique Binary Search Trees (hard) binary search tree dynamic programming recursion +2 more	34.4%	hard
7	Rearrange String (hard) greedy algorithm string backtracking +3 more	44.5%	hard
8	Valid Palindrome II (easy) string recursion backtracking +3 more	33.1%	easy
9	Maximum Length of Pair Chain (medium) greedy algorithm array sorting +1 more	30.4%	Med.
10	0/1 Knapsack (medium) greedy algorithm 0/1 knapsack dynamic programming +1 more	43.8%	Med.
11	Equal Subset Sum Partition (medium) dynamic programming recursion greedy algorithm +2 more	42.7%	Med.
12	Subset Sum (medium) dynamic programming recursion subsets +1 more	35.0%	Med.
13	Minimum Subset Sum Difference (hard) dynamic programming recursion greedy algorithm +3 more	50.7%	hard
14	Problem Challenge 1: Count of Subset Sum (hard) dynamic programming recursion subsets	55.6%	hard
15	Problem Challenge 2: Target Sum (hard) dynamic programming recursion backtracking +2 more	44.6%	hard
16	Combination Sum (medium) backtracking recursion dynamic programming	46.4%	Med.
17	Extra Characters in a String (medium) string array dynamic programming +3 more	53.0%	Med.
18	Path With Minimum Effort (medium) graph algorithms shortest path dynamic programming +2 more	40.8%	Med.
19	Maximum Product Subarray (medium) dynamic programming array greedy algorithm +1 more	22.3%	Med.
20	Palindromic Substrings (medium) dynamic programming string matching array +1 more	33.0%	Med.
21	House Robber II (medium) dynamic programming array greedy algorithm +2 more	20.3%	Med.
22	Decode Ways (medium) dynamic programming recursion string +1 more	17.2%	Med.
23	Unique Paths (medium) dynamic programming recursion	65.3%	Med.
24	Word Break (medium) dynamic programming recursion string +1 more	40.8%	Med.
25	Graph Valid Tree (medium) graph algorithms depth-first search breadth-first search +3 more	30.7%	Med.
26	Longest Valid Parentheses (hard) stack string breadth-first search +3 more	15.8%	hard