23b5dd754e
Looks like "Rotate Image" is the only Matrix problem that remains. It was nice to learn more about "Backtracking" -- a term I often encounter -- while attempting to solve "Word Search". From my current understanding, it is like Brute Force but with short-circuiting. It also seems quite similar to Depth First Search, and I'm currently unaware of how DFS and Backtracking differ. I'm hoping to learn more though.
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