c34a3e2e97
After solving this, I was immediately stumped by the other DP questions, so I'm taking a break.
6.7 KiB
6.7 KiB
- Array
- Binary
- Dynamic Programming
- Graph
- Interval
- Linked List
- Matrix
- String
- Tree
- Maximum Depth of Binary Tree
- Same Tree
- Invert/Flip Binary Tree
- Binary Tree Maximum Path Sum
- Binary Tree Level Order Traversal
- Serialize and Deserialize Binary Tree
- Subtree of Another Tree
- Construct Binary Tree from Preorder and Inorder Traversal
- Validate Binary Search Tree
- Kth Smallest Element in a BST
- Lowest Common Ancestor of BST
- Implement Trie (Prefix Tree)
- Add and Search Word
- Word Search II
- Heap