Recursion Interview Questions

Base cases, divide-and-conquer, and recursive state.

30 problems

#	Title	Difficulty	Topics
95	Unique Binary Search Trees II	Medium	recursion
98	Validate Binary Search Tree	Medium	recursion
100	Same Tree	Easy	recursion
104	Maximum Depth of Binary Tree	Easy	recursion
105	Construct Binary Tree from Preorder and Inorder Traversal	Medium	recursion
106	Construct Binary Tree from Inorder and Postorder Traversal	Medium	recursion
108	Convert Sorted Array to Binary Search Tree	Medium	recursion
109	Convert Sorted List to Binary Search Tree	Medium	recursion
110	Balanced Binary Tree	Easy	recursion
111	Minimum Depth of Binary Tree	Easy	recursion
114	Flatten Binary Tree to Linked List	Medium	recursion
116	Populating Next Right Pointers in Each Node	Medium	recursion
124	Binary Tree Maximum Path Sum	Hard	recursion
129	Sum Root to Leaf Numbers	Medium	recursion
156	Binary Tree Upside Down	Medium	recursion
241	Different Ways to Add Parentheses	Medium	recursion
298	Binary Tree Longest Consecutive Sequence	Medium	recursion
327	Count of Range Sum	Hard	recursion
333	Largest BST Subtree	Medium	recursion
337	House Robber III	Medium	recursion
395	Longest Substring with At Least K Repeating Characters	Medium	recursion
404	Sum of Left Leaves	Easy	recursion
437	Path Sum III	Easy	recursion
544	Output Contest Matches	Medium	recursion
549	Binary Tree Longest Consecutive Sequence II	Medium	recursion
669	Trim a Binary Search Tree	Easy	recursion
671	Second Minimum Node In a Binary Tree	Easy	recursion
761	Special Binary String	Hard	recursion
1106	Parsing A Boolean Expression	Hard	recursion
2613	Beautiful Pairs	Hard	recursion