| 0100 | Same Tree | Go | Easy | | | | 58.2% |
| 0101 | Symmetric Tree | Go | Easy | O(n) | O(1) | | 54.3% |
| 0102 | Binary Tree Level Order Traversal | Go | Medium | O(n) | O(1) | | 64.4% |
| 0103 | Binary Tree Zigzag Level Order Traversal | Go | Medium | O(n) | O(n) | | 56.9% |
| 0104 | Maximum Depth of Binary Tree | Go | Easy | | | | 73.9% |
| 0107 | Binary Tree Level Order Traversal II | Go | Medium | O(n) | O(1) | | 61.2% |
| 0111 | Minimum Depth of Binary Tree | Go | Easy | O(n) | O(1) | | 44.5% |
| 0112 | Path Sum | Go | Easy | | | | 48.3% |
| 0116 | Populating Next Right Pointers in Each Node | Go | Medium | | | | 60.4% |
| 0126 | Word Ladder II | Go | Hard | O(n) | O(n^2) | ❤️ | 27.5% |
| 0127 | Word Ladder | Go | Hard | O(n) | O(n) | | 37.2% |
| 0130 | Surrounded Regions | Go | Medium | | | | 36.8% |
| 0199 | Binary Tree Right Side View | Go | Medium | O(n) | O(1) | | 61.6% |
| 0200 | Number of Islands | Go | Medium | O(n^2) | O(n^2) | | 57.0% |
| 0207 | Course Schedule | Go | Medium | O(n^2) | O(n^2) | | 45.4% |
| 0210 | Course Schedule II | Go | Medium | O(n^2) | O(n^2) | | 48.5% |
| 0226 | Invert Binary Tree | Go | Easy | | | | 74.7% |
| 0279 | Perfect Squares | Go | Medium | | | | 52.7% |
| 0297 | Serialize and Deserialize Binary Tree | Go | Hard | | | | 55.4% |
| 0301 | Remove Invalid Parentheses | Go | Hard | | | | 47.2% |
| 0322 | Coin Change | Go | Medium | | | | 42.1% |
| 0329 | Longest Increasing Path in a Matrix | Go | Hard | | | | 52.4% |
| 0399 | Evaluate Division | Go | Medium | | | | 59.7% |
| 0404 | Sum of Left Leaves | Go | Easy | | | | 56.7% |
| 0417 | Pacific Atlantic Water Flow | Go | Medium | | | | 54.4% |
| 0429 | N-ary Tree Level Order Traversal | Go | Medium | | | | 70.7% |
| 0433 | Minimum Genetic Mutation | Go | Medium | | | | 52.4% |
| 0463 | Island Perimeter | Go | Easy | | | | 69.7% |
| 0488 | Zuma Game | Go | Hard | | | | 33.9% |
| 0513 | Find Bottom Left Tree Value | Go | Medium | | | | 66.9% |
| 0515 | Find Largest Value in Each Tree Row | Go | Medium | O(n) | O(n) | | 64.6% |
| 0529 | Minesweeper | Go | Medium | | | | 65.7% |
| 0530 | Minimum Absolute Difference in BST | Go | Easy | | | | 57.3% |
| 0542 | 01 Matrix | Go | Medium | O(n) | O(1) | | 44.8% |
| 0547 | Number of Provinces | Go | Medium | | | | 63.8% |
| 0559 | Maximum Depth of N-ary Tree | Go | Easy | | | | 71.7% |
| 0617 | Merge Two Binary Trees | Go | Easy | | | | 78.7% |
| 0623 | Add One Row to Tree | Go | Medium | | | | 59.5% |
| 0637 | Average of Levels in Binary Tree | Go | Easy | | | | 71.7% |
| 0653 | Two Sum IV - Input is a BST | Go | Easy | | | | 61.0% |
| 0662 | Maximum Width of Binary Tree | Go | Medium | | | | 40.7% |
| 0684 | Redundant Connection | Go | Medium | | | | 62.2% |
| 0685 | Redundant Connection II | Go | Hard | | | | 34.1% |
| 0690 | Employee Importance | Go | Medium | | | | 65.6% |
| 0695 | Max Area of Island | Go | Medium | | | | 71.8% |
| 0721 | Accounts Merge | Go | Medium | | | | 56.3% |
| 0733 | Flood Fill | Go | Easy | | | | 62.0% |
| 0752 | Open the Lock | Go | Medium | | | | 55.6% |
| 0756 | Pyramid Transition Matrix | Go | Medium | | | | 52.7% |
| 0765 | Couples Holding Hands | Go | Hard | | | | 56.6% |
| 0778 | Swim in Rising Water | Go | Hard | | | | 59.8% |
| 0783 | Minimum Distance Between BST Nodes | Go | Easy | | | | 59.3% |
| 0785 | Is Graph Bipartite? | Go | Medium | | | | 53.1% |
| 0802 | Find Eventual Safe States | Go | Medium | | | | 56.6% |
| 0815 | Bus Routes | Go | Hard | | | | 45.6% |
| 0839 | Similar String Groups | Go | Hard | | | | 48.0% |
| 0841 | Keys and Rooms | Go | Medium | | | | 71.5% |
| 0863 | All Nodes Distance K in Binary Tree | Go | Medium | | | | 62.3% |
| 0864 | Shortest Path to Get All Keys | Go | Hard | | | | 45.6% |
| 0909 | Snakes and Ladders | Go | Medium | | | | 45.1% |
| 0924 | Minimize Malware Spread | Go | Hard | | | | 42.1% |
| 0928 | Minimize Malware Spread II | Go | Hard | | | | 42.8% |
| 0958 | Check Completeness of a Binary Tree | Go | Medium | | | | 56.2% |
| 0959 | Regions Cut By Slashes | Go | Medium | | | | 69.1% |
| 0987 | Vertical Order Traversal of a Binary Tree | Go | Hard | | | | 45.1% |
| 0993 | Cousins in Binary Tree | Go | Easy | O(n) | O(1) | | 54.6% |
| 1020 | Number of Enclaves | Go | Medium | | | | 65.6% |
| 1034 | Coloring A Border | Go | Medium | | | | 49.2% |
| 1091 | Shortest Path in Binary Matrix | Go | Medium | | | | 44.7% |
| 1123 | Lowest Common Ancestor of Deepest Leaves | Go | Medium | | | | 70.9% |
| 1202 | Smallest String With Swaps | Go | Medium | | | | 57.7% |
| 1203 | Sort Items by Groups Respecting Dependencies | Go | Hard | | | | 51.2% |
| 1254 | Number of Closed Islands | Go | Medium | | | | 66.9% |
| 1293 | Shortest Path in a Grid with Obstacles Elimination | Go | Hard | | | | 45.3% |
| 1302 | Deepest Leaves Sum | Go | Medium | | | | 86.6% |
| 1306 | Jump Game III | Go | Medium | | | | 63.5% |
| 1319 | Number of Operations to Make Network Connected | Go | Medium | | | | 62.1% |
| 1609 | Even Odd Tree | Go | Medium | | | | 54.4% |
| 1631 | Path With Minimum Effort | Go | Medium | | | | 55.7% |
| 1654 | Minimum Jumps to Reach Home | Go | Medium | | | | 29.1% |
| ———— | ——————————————————- | ——- | —————- | ————— | ————- | ————- | ————- |