| 0128 | Longest Consecutive Sequence | Go | Medium | O(n) | O(n) | ❤️ | 48.9% |
| 0130 | Surrounded Regions | Go | Medium | O(m*n) | O(m*n) | | 35.9% |
| 0200 | Number of Islands | Go | Medium | O(m*n) | O(m*n) | | 56.2% |
| 0399 | Evaluate Division | Go | Medium | O(n) | O(n) | | 59.5% |
| 0547 | Number of Provinces | Go | Medium | O(n^2) | O(n) | | 63.3% |
| 0684 | Redundant Connection | Go | Medium | O(n) | O(n) | | 62.0% |
| 0685 | Redundant Connection II | Go | Hard | O(n) | O(n) | | 34.1% |
| 0695 | Max Area of Island | Go | Medium | | | | 71.7% |
| 0721 | Accounts Merge | Go | Medium | O(n) | O(n) | ❤️ | 56.3% |
| 0765 | Couples Holding Hands | Go | Hard | O(n) | O(n) | ❤️ | 56.9% |
| 0778 | Swim in Rising Water | Go | Hard | O(n^2) | O(n) | ❤️ | 59.6% |
| 0785 | Is Graph Bipartite? | Go | Medium | | | | 52.6% |
| 0803 | Bricks Falling When Hit | Go | Hard | O(n^2) | O(n) | ❤️ | 34.3% |
| 0839 | Similar String Groups | Go | Hard | O(n^2) | O(n) | | 47.6% |
| 0924 | Minimize Malware Spread | Go | Hard | O(m*n) | O(n) | | 42.1% |
| 0928 | Minimize Malware Spread II | Go | Hard | O(m*n) | O(n) | ❤️ | 42.6% |
| 0947 | Most Stones Removed with Same Row or Column | Go | Medium | O(n) | O(n) | | 57.1% |
| 0952 | Largest Component Size by Common Factor | Go | Hard | O(n) | O(n) | ❤️ | 40.4% |
| 0959 | Regions Cut By Slashes | Go | Medium | O(n^2) | O(n^2) | ❤️ | 69.1% |
| 0990 | Satisfiability of Equality Equations | Go | Medium | O(n) | O(n) | | 50.7% |
| 1020 | Number of Enclaves | Go | Medium | | | | 64.8% |
| 1202 | Smallest String With Swaps | Go | Medium | | | | 57.6% |
| 1254 | Number of Closed Islands | Go | Medium | | | | 64.2% |
| 1319 | Number of Operations to Make Network Connected | Go | Medium | | | | 58.3% |
| 1579 | Remove Max Number of Edges to Keep Graph Fully Traversable | Go | Hard | | | | 52.7% |
| 1631 | Path With Minimum Effort | Go | Medium | | | | 55.3% |
| ———— | ——————————————————- | ——- | —————- | ————— | ————- | ————- | ————- |
