Topic: Dynamic Programming

alleasymediumhard

alltodoattemptedfailedsolved

508 problems

#	Title	Status	Difficulty	Topics	Accept
5	Longest Palindromic Substring	—	Medium	Two PointersStringDynamic Programming	36%
10	Regular Expression Matching	—	Hard	StringDynamic ProgrammingRecursion	29%
22	Generate Parenthesesread	—	Medium	StringDynamic ProgrammingBacktracking	77%
32	Longest Valid Parentheses	—	Hard	StringDynamic ProgrammingStack	36%
42	Trapping Rain Water	—	Hard	ArrayTwo PointersDynamic Programming	65%
44	Wildcard Matching	—	Hard	StringDynamic ProgrammingGreedy	30%
45	Jump Game II	—	Medium	ArrayDynamic ProgrammingGreedy	41%
53	Maximum Subarray	—	Medium	ArrayDivide and ConquerDynamic Programming	52%
55	Jump Game	—	Medium	ArrayDynamic ProgrammingGreedy	39%
62	Unique Paths	—	Medium	MathDynamic ProgrammingCombinatorics	66%
63	Unique Paths II	—	Medium	ArrayDynamic ProgrammingMatrix	43%
64	Minimum Path Sum	—	Medium	ArrayDynamic ProgrammingMatrix	66%
70	Climbing Stairs	—	Easy	MathDynamic ProgrammingMemoization	53%
72	Edit Distance	—	Medium	StringDynamic Programming	59%
85	Maximal Rectangle	—	Hard	ArrayDynamic ProgrammingStack	53%
87	Scramble String	—	Hard	StringDynamic Programming	42%
91	Decode Ways	—	Medium	StringDynamic Programming	36%
95	Unique Binary Search Trees II	—	Medium	Dynamic ProgrammingBacktrackingTree	60%
96	Unique Binary Search Trees	—	Medium	MathDynamic ProgrammingTree	62%
97	Interleaving String	—	Medium	StringDynamic Programming	42%
115	Distinct Subsequences	—	Hard	StringDynamic Programming	50%
118	Pascal's Triangle	—	Easy	ArrayDynamic Programming	77%
119	Pascal's Triangle II	—	Easy	ArrayDynamic Programming	66%
120	Triangle	—	Medium	ArrayDynamic Programming	59%
121	Best Time to Buy and Sell Stock	—	Easy	ArrayDynamic Programming	55%
122	Best Time to Buy and Sell Stock II	—	Medium	ArrayDynamic ProgrammingGreedy	69%
123	Best Time to Buy and Sell Stock III	—	Hard	ArrayDynamic Programming	51%
124	Binary Tree Maximum Path Sum	—	Hard	Dynamic ProgrammingTreeDepth-First Search	41%
131	Palindrome Partitioning	—	Medium	StringDynamic ProgrammingBacktracking	72%
132	Palindrome Partitioning II	—	Hard	StringDynamic Programming	35%
139	Word Break	—	Medium	ArrayHash TableString	48%
140	Word Break II	—	Hard	ArrayHash TableString	53%
152	Maximum Product Subarray	—	Medium	ArrayDynamic Programming	35%
174	Dungeon Game	—	Hard	ArrayDynamic ProgrammingMatrix	39%
188	Best Time to Buy and Sell Stock IV	—	Hard	ArrayDynamic Programming	47%
198	House Robber	—	Medium	ArrayDynamic Programming	52%
213	House Robber II	—	Medium	ArrayDynamic Programming	43%
221	Maximal Square	—	Medium	ArrayDynamic ProgrammingMatrix	49%
233	Number of Digit One	—	Hard	MathDynamic ProgrammingRecursion	36%
241	Different Ways to Add Parenthesesread	—	Medium	MathStringDynamic Programming	72%
264	Ugly Number II	—	Medium	Hash TableMathDynamic Programming	49%
279	Perfect Squares	—	Medium	MathDynamic ProgrammingBreadth-First Search	56%
300	Longest Increasing Subsequence	—	Medium	ArrayBinary SearchDynamic Programming	58%
309	Best Time to Buy and Sell Stock with Cooldown	—	Medium	ArrayDynamic Programming	60%
312	Burst Balloons	—	Hard	ArrayDynamic Programming	61%
313	Super Ugly Number	—	Medium	ArrayMathDynamic Programming	45%
322	Coin Change	—	Medium	ArrayDynamic ProgrammingBreadth-First Search	46%
329	Longest Increasing Path in a Matrix	—	Hard	ArrayDynamic ProgrammingDepth-First Search	55%
337	House Robber III	—	Medium	Dynamic ProgrammingTreeDepth-First Search	55%
338	Counting Bits	—	Easy	Dynamic ProgrammingBit Manipulation	80%

Page 1 of 11