[Leetcode] DFS problems

Letter Combinations of a Phone Number	3	3	string	dfs
Generate Parentheses	3	4	string	dfs
Sudoku Solver	4	2	array	dfs
N-Queens	4	3	array	dfs
N-Queens II	4	3	array	dfs
Word Search	3	4	array	dfs
Restore IP Addresses	3	3	string	dfs
Unique Binary Search Trees II	4	1	tree	dp dfs
Validate Binary Search Tree	3	5	tree	dfs
Recover Binary Search Tree	4	2	tree	dfs
Same Tree	1	1	tree	dfs
Symmetric Tree	1	2	tree	dfs
Maximum Depth of Binary Tree	1	1	tree	dfs
Construct Binary Tree from Preorder and Inorder Tr	3	3	array tree	dfs
Construct Binary Tree from Inorder and Postorder T	3	3	array tree	dfs
Convert Sorted Array to Binary Search Tree	2	3	tree	dfs
Balanced Binary Tree	1	2	tree	dfs
Minimum Depth of Binary Tree	1	1	tree	dfs
Path Sum	1	3	tree	dfs
Path Sum II	2	2	tree	dfs
Populating Next Right Pointers in Each Node	3	3	tree	dfs
Populating Next Right Pointers in Each Node II	4	2	tree	dfs
Binary Tree Maximum Path Sum	4	2	tree	dfs
Sum Root to Leaf Numbers	2	4	tree	dfs
Surrounded Regions	4	3	array	bfs dfs
Palindrome Partitioning	3	4	string	dfs

[Leetcode] DP problems

Regular Expression Matching	5	3	string	recursion dp
Longest Valid Parentheses	4	1	string	dp
Wildcard Matching	5	3	string	recursion dp greedy
Maximum Subarray	3	3	array	dp
Unique Paths	2	3	array	dp
Unique Paths II	3	3	array	dp
Minimum Path Sum	3	3	array	dp
Climbing Stairs	2	5		dp
Edit Distance	4	3	string	dp
Maximal Rectangle	5	1	array	dp stack
Scramble String	5	2	string	recursion dp
Decode Ways	3	4	string	recursion dp
Unique Binary Search Trees II	4	1	tree	dp dfs
Unique Binary Search Trees	3	1	tree	dp
Interleaving String	5	2	string	recursion dp
Distinct Subsequences	4	2	string	dp
Triangle	3	1	array	dp
Best Time to Buy and Sell Stock	2	1	array	dp
Best Time to Buy and Sell Stock III	4	1	array	dp
Palindrome Partitioning II	4	3	string	dp