| 128 | Longest Consecutive Sequence | — | Medium | ArrayHash TableUnion Find | 47% | |
| 130 | Surrounded Regions | — | Medium | ArrayDepth-First SearchBreadth-First Search | 43% | |
| 200 | Number of Islands | — | Medium | ArrayDepth-First SearchBreadth-First Search | 62% | |
| 261 | Graph Valid Tree | — | Medium | Depth-First SearchBreadth-First SearchUnion Find | 49% | |
| 323 | Number of Connected Components in an Undirected Graphread | — | Medium | Depth-First SearchBreadth-First SearchUnion Find | 64% | |
| 399 | Evaluate Divisionread | — | Medium | ArrayStringDepth-First Search | 63% | |
| 547 | Number of Provinces | — | Medium | Depth-First SearchBreadth-First SearchUnion Find | 68% | |
| 684 | Redundant Connectionread | — | Medium | Depth-First SearchBreadth-First SearchUnion Find | 66% | |
| 685 | Redundant Connection IIread | — | Hard | Depth-First SearchBreadth-First SearchUnion Find | 35% | |
| 695 | Max Area of Island | — | Medium | ArrayDepth-First SearchBreadth-First Search | 73% | |
| 721 | Accounts Merge | — | Medium | ArrayHash TableString | 59% | |
| 765 | Couples Holding Handsread | — | Hard | GreedyDepth-First SearchBreadth-First Search | 58% | |
| 778 | Swim in Rising Waterread | — | Hard | ArrayBinary SearchDepth-First Search | 63% | |
| 785 | Is Graph Bipartite?read | — | Medium | Depth-First SearchBreadth-First SearchUnion Find | 58% | |
| 803 | Bricks Falling When Hitread | — | Hard | ArrayUnion FindMatrix | 36% | |
| 827 | Making A Large Islandread | — | Hard | ArrayDepth-First SearchBreadth-First Search | 55% | |
| 839 | Similar String Groupsread | — | Hard | ArrayHash TableString | 55% | |
| 886 | Possible Bipartitionread | — | Medium | Depth-First SearchBreadth-First SearchUnion Find | 51% | |
| 924 | Minimize Malware Spreadread | — | Hard | ArrayHash TableDepth-First Search | 42% | |
| 928 | Minimize Malware Spread IIread | — | Hard | ArrayHash TableDepth-First Search | 45% | |
| 947 | Most Stones Removed with Same Row or Column | — | Medium | Hash TableDepth-First SearchUnion Find | 62% | |
| 952 | Largest Component Size by Common Factorread | — | Hard | ArrayHash TableMath | 41% | |
| 959 | Regions Cut By Slashesread | — | Medium | ArrayHash TableDepth-First Search | 78% | |
| 990 | Satisfiability of Equality Equations | — | Medium | ArrayStringUnion Find | 51% | |
| 1020 | Number of Enclavesread | — | Medium | ArrayDepth-First SearchBreadth-First Search | 70% | |
| 1061 | Lexicographically Smallest Equivalent Stringread | — | Medium | StringUnion Find | 77% | |
| 1202 | Smallest String With Swapsread | — | Medium | ArrayHash TableString | 59% | |
| 1254 | Number of Closed Islandsread | — | Medium | ArrayDepth-First SearchBreadth-First Search | 67% | |
| 1267 | Count Servers that Communicateread | — | Medium | ArrayDepth-First SearchBreadth-First Search | 73% | |
| 1319 | Number of Operations to Make Network Connectedread | — | Medium | Depth-First SearchBreadth-First SearchUnion Find | 64% | |
| 1361 | Validate Binary Tree Nodesread | — | Medium | TreeDepth-First SearchBreadth-First Search | 44% | |
| 1391 | Check if There is a Valid Path in a Gridread | — | Medium | ArrayDepth-First SearchBreadth-First Search | 49% | |
| 1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Treeread | — | Hard | Union FindGraphSorting | 66% | |
| 1559 | Detect Cycles in 2D Gridread | — | Medium | ArrayDepth-First SearchBreadth-First Search | 50% | |
| 1569 | Number of Ways to Reorder Array to Get Same BSTread | — | Hard | ArrayMathDivide and Conquer | 54% | |
| 1579 | Remove Max Number of Edges to Keep Graph Fully Traversableread | — | Hard | Union FindGraph | 70% | |
| 1584 | Min Cost to Connect All Pointsread | — | Medium | ArrayUnion FindGraph | 69% | |
| 1627 | Graph Connectivity With Thresholdread | — | Hard | ArrayMathUnion Find | 48% | |
| 1631 | Path With Minimum Effortread | — | Medium | ArrayBinary SearchDepth-First Search | 61% | |
| 1632 | Rank Transform of a Matrixread | — | Hard | ArrayUnion FindGraph | 41% | |
| 1697 | Checking Existence of Edge Length Limited Pathsread | — | Hard | ArrayTwo PointersUnion Find | 63% | |
| 1722 | Minimize Hamming Distance After Swap Operationsread | — | Medium | ArrayDepth-First SearchUnion Find | 48% | |
| 1905 | Count Sub Islandsread | — | Medium | ArrayDepth-First SearchBreadth-First Search | 73% | |
| 1970 | Last Day Where You Can Still Crossread | — | Hard | ArrayBinary SearchDepth-First Search | 62% | |
| 1971 | Find if Path Exists in Graphread | — | Easy | Depth-First SearchBreadth-First SearchUnion Find | 54% | |
| 1998 | GCD Sort of an Arrayread | — | Hard | ArrayMathUnion Find | 46% | |
| 2003 | Smallest Missing Genetic Value in Each Subtreeread | — | Hard | Dynamic ProgrammingTreeDepth-First Search | 46% | |
| 2076 | Process Restricted Friend Requestsread | — | Hard | Union FindGraph | 57% | |
| 2092 | Find All People With Secretread | — | Hard | Depth-First SearchBreadth-First SearchUnion Find | 45% | |
| 2157 | Groups of Stringsread | — | Hard | StringBit ManipulationUnion Find | 27% | |