| Number of Islands | Medium | 63.8% |
| Divide Nodes Into the Maximum Number of Groups | Hard | 67.0% |
| Longest Consecutive Sequence | Medium | 47.0% |
| Surrounded Regions | Medium | 44.7% |
| Number of Provinces | Medium | 70.0% |
| Max Area of Island | Medium | 73.8% |
| Making A Large Island | Hard | 56.3% |
| Accounts Merge | Medium | 60.9% |
| Number of Operations to Make Network Connected | Medium | 66.1% |
| Evaluate Division | Medium | 64.0% |
| Redundant Connection | Medium | 67.2% |
| Swim in Rising Water | Hard | 67.6% |
| Is Graph Bipartite? | Medium | 58.9% |
| Similar String Groups | Hard | 56.1% |
| Most Stones Removed with Same Row or Column | Medium | 62.7% |
| Regions Cut By Slashes | Medium | 77.5% |
| Number of Enclaves | Medium | 71.5% |
| Number of Closed Islands | Medium | 67.0% |
| Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard | 66.3% |
| Min Cost to Connect All Points | Medium | 70.3% |
| Path With Minimum Effort | Medium | 62.8% |
| Count Sub Islands | Medium | 73.0% |
| Find if Path Exists in Graph | Easy | 54.7% |
| GCD Sort of an Array | Hard | 48.5% |
| Find All People With Secret | Hard | 48.4% |
| Count Unreachable Pairs of Nodes in an Undirected Graph | Medium | 49.8% |
| Minimum Cost Walk in Weighted Graph | Hard | 68.3% |
| Count the Number of Complete Components | Medium | 77.7% |
| Check if the Rectangle Corner Is Reachable | Hard | 25.3% |
| Subarray With Elements Greater Than Varying Threshold | Hard | 45.2% |
| Count Servers that Communicate | Medium | 73.5% |
| Make Lexicographically Smallest Array by Swapping Elements | Medium | 60.2% |
| Maximum Number of Fish in a Grid | Medium | 70.5% |
| Minimum Score of a Path Between Two Cities | Medium | 58.5% |
| Detect Cycles in 2D Grid | Medium | 52.4% |
| Data Stream as Disjoint Intervals | Hard | 60.0% |
| Possible Bipartition | Medium | 52.3% |
| Lexicographically Smallest Equivalent String | Medium | 81.1% |
| Minimize Malware Spread | Hard | 42.9% |
| Last Day Where You Can Still Cross | Hard | 68.6% |
| Minimum Operations to Equalize Binary String | Hard | 20.3% |
| Number of Good Paths | Hard | 56.3% |
| Power Grid Maintenance | Medium | 56.3% |
| Minimum Time for K Connected Components | Medium | 45.1% |
| Minimum Reverse Operations | Hard | 16.6% |
| Maximum Number of Points From Grid Queries | Hard | 59.3% |
| Minimize Maximum Component Cost | Medium | 43.4% |
| Couples Holding Hands | Hard | 59.2% |
| Smallest String With Swaps | Medium | 60.3% |
| Rank Transform of a Matrix | Hard | 42.0% |
| Satisfiability of Equality Equations | Medium | 51.5% |
| Number of Ways to Reorder Array to Get Same BST | Hard | 54.0% |
| Minimum Number of Visited Cells in a Grid | Hard | 23.6% |
| Remove Max Number of Edges to Keep Graph Fully Traversable | Hard | 70.2% |
| Minimize Malware Spread II | Hard | 45.4% |
| Maximum Partition Factor | Hard | 31.0% |
| Bricks Falling When Hit | Hard | 36.9% |
| Largest Component Size by Common Factor | Hard | 42.4% |
| Checking Existence of Edge Length Limited Paths | Hard | 63.2% |
| Minimize Hamming Distance After Swap Operations | Medium | 49.1% |
| Process Restricted Friend Requests | Hard | 59.4% |
| Longest Uploaded Prefix | Medium | 54.7% |
| Find the Safest Path in a Grid | Medium | 48.6% |
| Redundant Connection II | Hard | 35.9% |
| Validate Binary Tree Nodes | Medium | 44.1% |
| Find the String with LCP | Hard | 32.5% |
| Path Existence Queries in a Graph I | Medium | 55.3% |
| Count Islands With Total Value Divisible by K | Medium | 56.3% |
| Maximize Alternating Sum Using Swaps | Hard | 64.1% |
| Maximum Segment Sum After Removals | Hard | 49.3% |
| Groups of Strings | Hard | 27.4% |
| Reachable Nodes With Restrictions | Medium | 60.2% |
| Check if There is a Valid Path in a Grid | Medium | 50.0% |
| Graph Connectivity With Threshold | Hard | 49.2% |