dfs 31
- 2-D DP: Longest Increasing Path In a Matrix — Kotlin Solution
- Advanced Graphs: Reconstruct Itinerary — Kotlin Solution
- Advanced Graphs: Alien Dictionary — Kotlin Solution
- Graphs: Surrounded Regions — Kotlin Solution
- Graphs: Pacific Atlantic Water Flow — Kotlin Solution
- Graphs: Number of Islands — Kotlin Solution
- Graphs: Number of Connected Components In An Undirected Graph — Kotlin Solution
- Graphs: Max Area of Island — Kotlin Solution
- Graphs: Graph Valid Tree — Kotlin Solution
- Graphs: Course Schedule — Kotlin Solution
- Graphs: Course Schedule II — Kotlin Solution
- Graphs: Clone Graph — Kotlin Solution
- Backtracking: Word Search — Kotlin Solution
- Trie: Word Search II — Kotlin Solution
- Trie: Design Add And Search Words Data Structure — Kotlin Solution
- Trees: Validate Binary Search Tree — Kotlin Solution
- Trees: Subtree of Another Tree — Kotlin Solution
- Trees: Serialize And Deserialize Binary Tree — Kotlin Solution
- Trees: Same Tree — Kotlin Solution
- Trees: Maximum Depth of Binary Tree — Kotlin Solution
- Trees: Lowest Common Ancestor of a Binary Search Tree — Kotlin Solution
- Trees: Kth Smallest Element In a BST — Kotlin Solution
- Trees: Invert Binary Tree — Kotlin Solution
- Trees: Diameter of Binary Tree — Kotlin Solution
- Trees: Count Good Nodes In Binary Tree — Kotlin Solution
- Trees: Construct Binary Tree From Preorder And Inorder Traversal — Kotlin Solution
- Trees: Binary Tree Right Side View — Kotlin Solution
- Trees: Binary Tree Maximum Path Sum — Kotlin Solution
- Trees: Balanced Binary Tree — Kotlin Solution
- Trees: Validate Binary Search Tree — Kotlin Solution
- Trees: Maximum Depth of Binary Tree — Kotlin Solution