| Number of Islands | Medium | 63.8% | 65.6% |
| Course Schedule | Medium | 50.8% | 51.5% |
| Rotting Oranges | Medium | 58.2% | 51.1% |
| Coin Change | Medium | 48.0% | 49.4% |
| Same Tree | Easy | 66.7% | 46.3% |
| Surrounded Regions | Medium | 44.8% | 43.4% |
| Pacific Atlantic Water Flow | Medium | 60.6% | 42.7% |
| Apply Substitutions | Medium | 77.5% | 42.7% |
| Binary Tree Level Order Traversal | Medium | 72.2% | 42.4% |
| Invert Binary Tree | Easy | 79.8% | 42.4% |
| Number of Provinces | Medium | 70.0% | 41.7% |
| Word Ladder | Hard | 44.9% | 41.7% |
| Symmetric Tree | Easy | 60.8% | 40.5% |
| Swim in Rising Water | Hard | 67.6% | 40.2% |
| Clone Graph | Medium | 64.7% | 39.8% |
| Perfect Squares | Medium | 56.3% | 39.8% |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.2% | 39.3% |
| Trapping Rain Water II | Hard | 64.0% | 39.3% |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 38.5% |
| 01 Matrix | Medium | 53.4% | 38.5% |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 38.5% |
| Shortest Path in a Grid with Obstacles Elimination | Hard | 46.1% | 38.0% |
| Evaluate Division | Medium | 64.0% | 37.6% |
| Maximum Depth of Binary Tree | Easy | 77.9% | 37.1% |
| Path With Minimum Effort | Medium | 62.8% | 37.1% |
| Cheapest Flights Within K Stops | Medium | 41.4% | 36.6% |
| Course Schedule II | Medium | 55.0% | 36.6% |
| Alien Dictionary | Hard | 37.1% | 36.6% |
| Network Delay Time | Medium | 59.8% | 36.1% |
| Redundant Connection | Medium | 67.3% | 36.1% |
| Accounts Merge | Medium | 60.9% | 35.6% |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 35.1% |
| Find Eventual Safe States | Medium | 70.3% | 34.5% |
| Bus Routes | Hard | 47.1% | 33.9% |
| Shortest Path in Binary Matrix | Medium | 51.1% | 33.9% |
| Number of Closed Islands | Medium | 67.0% | 33.9% |
| Find the Safest Path in a Grid | Medium | 48.6% | 33.9% |
| Binary Tree Right Side View | Medium | 69.5% | 33.3% |
| Max Area of Island | Medium | 73.8% | 33.3% |
| Height of Binary Tree After Subtree Removal Queries | Hard | 54.9% | 33.3% |
| Minimum Cost to Make at Least One Valid Path in a Grid | Hard | 70.9% | 32.7% |
| Detonate the Maximum Bombs | Medium | 49.9% | 32.7% |
| Shortest Path Visiting All Nodes | Hard | 65.8% | 32.0% |
| Flood Fill | Easy | 67.9% | 31.4% |
| Making A Large Island | Hard | 56.3% | 31.4% |
| Graph Valid Tree | Medium | 49.8% | 31.4% |
| Keys and Rooms | Medium | 75.5% | 31.4% |
| Regions Cut By Slashes | Medium | 77.5% | 30.7% |
| Binary Tree Vertical Order Traversal | Medium | 57.8% | 30.7% |
| Maximum Level Sum of a Binary Tree | Medium | 70.0% | 29.9% |
| Snakes and Ladders | Medium | 48.0% | 29.9% |
| Minimum Absolute Difference in BST | Easy | 59.2% | 29.9% |
| Minimum Height Trees | Medium | 42.4% | 29.9% |
| Word Ladder II | Hard | 27.5% | 29.1% |
| All Nodes Distance K in Binary Tree | Medium | 67.4% | 29.1% |
| Number of Enclaves | Medium | 71.5% | 29.1% |
| Two Sum IV - Input is a BST | Easy | 63.0% | 28.3% |
| Maximum Width of Binary Tree | Medium | 45.3% | 28.3% |
| Island Perimeter | Easy | 74.3% | 28.3% |
| Is Graph Bipartite? | Medium | 58.9% | 28.3% |
| Walls and Gates | Medium | 63.8% | 28.3% |
| Path Sum | Easy | 54.5% | 27.5% |
| Shortest Distance from All Buildings | Hard | 44.9% | 27.5% |
| Count Servers that Communicate | Medium | 73.5% | 27.5% |
| Find if Path Exists in Graph | Easy | 54.8% | 26.5% |
| Time Needed to Inform All Employees | Medium | 60.4% | 26.5% |
| Find All People With Secret | Hard | 48.4% | 26.5% |
| Kth Ancestor of a Tree Node | Hard | 37.2% | 26.5% |
| Shortest Bridge | Medium | 59.3% | 25.6% |
| Path With Maximum Minimum Value | Medium | 54.6% | 25.6% |
| Number of Connected Components in an Undirected Graph | Medium | 64.8% | 25.6% |
| Minimum Obstacle Removal to Reach Corner | Hard | 70.5% | 25.6% |
| Minimum Knight Moves | Medium | 41.8% | 25.6% |
| Jump Game IV | Hard | 46.2% | 24.5% |
| Populating Next Right Pointers in Each Node | Medium | 66.9% | 24.5% |
| The Maze | Medium | 60.3% | 24.5% |
| Similar String Groups | Hard | 56.1% | 24.5% |
| Redundant Connection II | Hard | 35.9% | 23.4% |
| Disconnect Path in a Binary Matrix by at Most One Flip | Medium | 27.8% | 23.4% |
| Sentence Similarity II | Medium | 51.1% | 23.4% |
| Map of Highest Peak | Medium | 75.7% | 23.4% |
| Smallest Rectangle Enclosing Black Pixels | Hard | 60.8% | 23.4% |
| Water and Jug Problem | Medium | 45.0% | 22.3% |
| Deepest Leaves Sum | Medium | 86.5% | 22.3% |
| Freedom Trail | Hard | 59.2% | 22.3% |
| Shortest Path to Get All Keys | Hard | 54.3% | 22.3% |
| All Ancestors of a Node in a Directed Acyclic Graph | Medium | 62.1% | 22.3% |
| Minimum Distance Between BST Nodes | Easy | 61.1% | 22.3% |
| Couples Holding Hands | Hard | 59.2% | 22.3% |
| K-Similar Strings | Hard | 40.6% | 22.3% |
| Last Day Where You Can Still Cross | Hard | 68.6% | 21.0% |
| Minimum Depth of Binary Tree | Easy | 52.4% | 21.0% |
| Operations on Tree | Medium | 45.0% | 21.0% |
| Minimum Operations to Convert Number | Medium | 51.5% | 21.0% |
| The Maze II | Medium | 55.0% | 21.0% |
| Brace Expansion II | Hard | 63.9% | 21.0% |
| Minimum Path Cost in a Hidden Grid | Medium | 58.7% | 21.0% |
| Brace Expansion | Medium | 66.8% | 19.6% |
| Frog Position After T Seconds | Hard | 37.9% | 19.6% |
| Remove All Ones With Row and Column Flips II | Medium | 67.3% | 19.6% |
| Complete Binary Tree Inserter | Medium | 65.0% | 19.6% |
| Tree Diameter | Medium | 61.3% | 19.6% |
| Find Elements in a Contaminated Binary Tree | Medium | 84.1% | 19.6% |
| Find Nearest Right Node in Binary Tree | Medium | 75.1% | 19.6% |
| Correct a Binary Tree | Medium | 74.3% | 19.6% |
| Minimum Genetic Mutation | Medium | 56.4% | 18.1% |
| Serialize and Deserialize N-ary Tree | Hard | 68.6% | 18.1% |
| Employee Importance | Medium | 69.3% | 18.1% |
| Nested List Weight Sum | Medium | 85.9% | 16.5% |
| Minimum Time to Visit a Cell In a Grid | Hard | 56.3% | 16.5% |
| Populating Next Right Pointers in Each Node II | Medium | 57.1% | 16.5% |
| Detect Cycles in 2D Grid | Medium | 52.5% | 14.7% |
| Sum of Left Leaves | Easy | 62.4% | 14.7% |
| Remove Invalid Parentheses | Hard | 49.8% | 14.7% |
| Smallest String With Swaps | Medium | 60.4% | 14.7% |
| Check Completeness of a Binary Tree | Medium | 59.0% | 14.7% |
| Lowest Common Ancestor of Deepest Leaves | Medium | 79.4% | 14.7% |
| Minimize the Maximum Edge Weight of Graph | Medium | 44.0% | 14.7% |
| Nearest Exit from Entrance in Maze | Medium | 48.3% | 12.7% |
| Binary Tree Level Order Traversal II | Medium | 67.7% | 12.7% |
| Open the Lock | Medium | 61.2% | 12.7% |
| Divide Nodes Into the Maximum Number of Groups | Hard | 67.0% | 12.7% |
| Cousins in Binary Tree II | Medium | 75.8% | 12.7% |
| Reverse Odd Levels of Binary Tree | Medium | 86.7% | 12.7% |
| Find Largest Value in Each Tree Row | Medium | 66.3% | 12.7% |
| Minimum Jumps to Reach End via Prime Teleportation | Medium | 31.8% | 10.5% |
| Count Good Nodes in Binary Tree | Medium | 73.8% | 10.5% |
| Escape the Spreading Fire | Hard | 37.6% | 10.5% |
| Possible Bipartition | Medium | 52.4% | 10.5% |
| Merge Two Binary Trees | Easy | 79.0% | 10.5% |
| Cousins in Binary Tree | Easy | 59.1% | 10.5% |
| Second Minimum Time to Reach Destination | Hard | 62.4% | 10.5% |
| Course Schedule IV | Medium | 59.7% | 10.5% |
| Nested List Weight Sum II | Medium | 66.8% | 10.5% |
| Average of Levels in Binary Tree | Easy | 74.7% | 10.5% |
| Power Grid Maintenance | Medium | 56.3% | 10.5% |
| Print Binary Tree | Medium | 66.4% | 10.5% |
| Number of Distinct Islands | Medium | 62.7% | 10.5% |
| Minimum Score of a Path Between Two Cities | Medium | 58.6% | 10.5% |
| Smallest Subtree with all the Deepest Nodes | Medium | 77.5% | 8.1% |
| Coloring A Border | Medium | 51.1% | 8.1% |
| Minesweeper | Medium | 68.7% | 8.1% |
| Count Sub Islands | Medium | 73.0% | 8.1% |
| Shortest Distance After Road Addition Queries I | Medium | 61.9% | 8.1% |
| Find a Safe Walk Through a Grid | Medium | 32.7% | 8.1% |
| Serialize and Deserialize BST | Medium | 59.4% | 8.1% |
| Maximize the Number of Target Nodes After Connecting Trees I | Medium | 69.5% | 8.1% |
| Maximum Number of Points From Grid Queries | Hard | 59.3% | 8.1% |
| All Paths From Source to Target | Medium | 83.5% | 8.1% |
| Maximize the Number of Target Nodes After Connecting Trees II | Hard | 73.2% | 8.1% |
| Sort Items by Groups Respecting Dependencies | Hard | 65.6% | 8.1% |
| Longest Cycle in a Graph | Hard | 50.5% | 8.1% |
| Amount of Time for Binary Tree to Be Infected | Medium | 65.1% | 8.1% |
| N-ary Tree Level Order Traversal | Medium | 71.5% | 8.1% |
| Check if the Rectangle Corner Is Reachable | Hard | 25.3% | 8.1% |
| Find Minimum Diameter After Merging Two Trees | Hard | 57.1% | 8.1% |
| Univalued Binary Tree | Easy | 72.9% | 8.1% |
| Reorder Routes to Make All Paths Lead to the City Zero | Medium | 65.6% | 8.1% |
| Minimum Operations to Equalize Binary String | Hard | 45.6% | 8.1% |
| Minimum Moves to Move a Box to Their Target Location | Hard | 49.5% | 8.1% |
| Count Unreachable Pairs of Nodes in an Undirected Graph | Medium | 49.8% | 5.5% |
| Find Bottom Left Tree Value | Medium | 72.2% | 5.5% |
| Maximum Number of Fish in a Grid | Medium | 70.5% | 5.5% |
| Minimum Fuel Cost to Report to the Capital | Medium | 64.9% | 5.5% |
| Sliding Puzzle | Hard | 74.2% | 5.5% |
| Minimum Number of Operations to Sort a Binary Tree by Level | Medium | 74.2% | 5.5% |
| Number of Distinct Islands II | Hard | 55.3% | 5.5% |
| Count the Number of Complete Components | Medium | 77.8% | 5.5% |
| Maximum Candies You Can Get from Boxes | Hard | 67.9% | 5.5% |
| Number of Operations to Make Network Connected | Medium | 66.2% | 5.5% |
| Check if There is a Valid Path in a Grid | Medium | 50.1% | 5.0% |
| Shortest Path with Alternating Colors | Medium | 47.7% | 5.0% |
| Maximum Partition Factor | Hard | 31.1% | 5.0% |
| Most Profitable Path in a Tree | Medium | 67.3% | 5.0% |
| Add One Row to Tree | Medium | 64.1% | 5.0% |
| Validate Binary Tree Nodes | Medium | 44.1% | 5.0% |
| Check Knight Tour Configuration | Medium | 60.6% | 5.0% |
| Maximum Number of Moves to Kill All Pawns | Hard | 33.7% | 5.0% |
| Kth Largest Sum in a Binary Tree | Medium | 59.0% | 5.0% |
| Maximize Amount After Two Days of Conversions | Medium | 61.2% | 5.0% |
| Contain Virus | Hard | 54.4% | 5.0% |
| Numbers With Same Consecutive Differences | Medium | 59.1% | 5.0% |
| Closest Node to Path in Tree | Hard | 62.4% | 5.0% |
| Minimize Malware Spread | Hard | 43.0% | 5.0% |
| Web Crawler Multithreaded | Medium | 51.0% | 5.0% |
| Find All Groups of Farmland | Medium | 75.5% | 5.0% |
| Shortest Path in a Hidden Grid | Medium | 44.5% | 5.0% |
| The Maze III | Hard | 52.3% | 5.0% |
| Count Islands With Total Value Divisible by K | Medium | 56.3% | 5.0% |
| Escape a Large Maze | Hard | 36.3% | 5.0% |
| Zuma Game | Hard | 30.2% | 5.0% |
| Minimum Number of Days to Disconnect Island | Hard | 58.8% | 5.0% |
| As Far from Land as Possible | Medium | 52.2% | 5.0% |
| Reachable Nodes With Restrictions | Medium | 60.2% | 5.0% |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.3% | 5.0% |
| Shortest Cycle in a Graph | Hard | 39.2% | 5.0% |
