mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-24 02:14:00 +08:00
3.6 KiB
3.6 KiB
| title | type |
|---|---|
| Breadth First Search | docs |
Breadth First Search
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity | Favorite | Acceptance |
|---|---|---|---|---|---|---|---|
| 0101 | Symmetric Tree | [Go]({{< relref "/ChapterFour/0101.Symmetric-Tree.md" >}}) | Easy | O(n) | O(1) | 47.9% | |
| 0102 | Binary Tree Level Order Traversal | [Go]({{< relref "/ChapterFour/0102.Binary-Tree-Level-Order-Traversal.md" >}}) | Medium | O(n) | O(1) | 56.3% | |
| 0103 | Binary Tree Zigzag Level Order Traversal | [Go]({{< relref "/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md" >}}) | Medium | O(n) | O(n) | 49.8% | |
| 0107 | Binary Tree Level Order Traversal II | [Go]({{< relref "/ChapterFour/0107.Binary-Tree-Level-Order-Traversal-II.md" >}}) | Easy | O(n) | O(1) | 54.9% | |
| 0111 | Minimum Depth of Binary Tree | [Go]({{< relref "/ChapterFour/0111.Minimum-Depth-of-Binary-Tree.md" >}}) | Easy | O(n) | O(1) | 39.3% | |
| 0126 | Word Ladder II | [Go]({{< relref "/ChapterFour/0126.Word-Ladder-II.md" >}}) | Hard | O(n) | O(n^2) | ❤️ | 23.5% |
| 0127 | Word Ladder | [Go]({{< relref "/ChapterFour/0127.Word-Ladder.md" >}}) | Hard | O(n) | O(n) | 31.5% | |
| 0130 | Surrounded Regions | [Go]({{< relref "/ChapterFour/0130.Surrounded-Regions.md" >}}) | Medium | 29.2% | |||
| 0199 | Binary Tree Right Side View | [Go]({{< relref "/ChapterFour/0199.Binary-Tree-Right-Side-View.md" >}}) | Medium | O(n) | O(1) | 55.8% | |
| 0200 | Number of Islands | [Go]({{< relref "/ChapterFour/0200.Number-of-Islands.md" >}}) | Medium | O(n^2) | O(n^2) | 48.7% | |
| 0207 | Course Schedule | [Go]({{< relref "/ChapterFour/0207.Course-Schedule.md" >}}) | Medium | O(n^2) | O(n^2) | 44.3% | |
| 0210 | Course Schedule II | [Go]({{< relref "/ChapterFour/0210.Course-Schedule-II.md" >}}) | Medium | O(n^2) | O(n^2) | 42.3% | |
| 0513 | Find Bottom Left Tree Value | [Go]({{< relref "/ChapterFour/0513.Find-Bottom-Left-Tree-Value.md" >}}) | Medium | 62.4% | |||
| 0515 | Find Largest Value in Each Tree Row | [Go]({{< relref "/ChapterFour/0515.Find-Largest-Value-in-Each-Tree-Row.md" >}}) | Medium | O(n) | O(n) | 62.1% | |
| 0529 | Minesweeper | [Go]({{< relref "/ChapterFour/0529.Minesweeper.md" >}}) | Medium | 60.8% | |||
| 0542 | 01 Matrix | [Go]({{< relref "/ChapterFour/0542.01-Matrix.md" >}}) | Medium | O(n) | O(1) | 40.7% | |
| 0785 | Is Graph Bipartite? | [Go]({{< relref "/ChapterFour/0785.Is-Graph-Bipartite.md" >}}) | Medium | 48.2% | |||
| 0815 | Bus Routes | [Go]({{< relref "/ChapterFour/0815.Bus-Routes.md" >}}) | Hard | 43.3% | |||
| 0863 | All Nodes Distance K in Binary Tree | [Go]({{< relref "/ChapterFour/0863.All-Nodes-Distance-K-in-Binary-Tree.md" >}}) | Medium | 57.6% | |||
| 0864 | Shortest Path to Get All Keys | [Go]({{< relref "/ChapterFour/0864.Shortest-Path-to-Get-All-Keys.md" >}}) | Hard | 41.6% | |||
| 0993 | Cousins in Binary Tree | [Go]({{< relref "/ChapterFour/0993.Cousins-in-Binary-Tree.md" >}}) | Easy | O(n) | O(1) | 52.3% | |
| 1306 | Jump Game III | [Go]({{< relref "/ChapterFour/1306.Jump-Game-III.md" >}}) | Medium | 62.6% | |||
| 1319 | Number of Operations to Make Network Connected | [Go]({{< relref "/ChapterFour/1319.Number-of-Operations-to-Make-Network-Connected.md" >}}) | Medium | 55.1% | |||
| 1654 | Minimum Jumps to Reach Home | [Go]({{< relref "/ChapterFour/1654.Minimum-Jumps-to-Reach-Home.md" >}}) | Medium | 26.2% | |||
| ------------ | ------------------------------------------------------- | ------- | ---------------- | --------------- | ------------- | ------------- | ------------- |