| Count Univalue Subtrees | Medium | 57.5% |
| Binary Tree Cameras | Hard | 47.6% |
| Number of Islands | Medium | 63.8% |
| Divide Nodes Into the Maximum Number of Groups | Hard | 67.0% |
| Word Search | Medium | 46.9% |
| Maximum Depth of Binary Tree | Easy | 77.9% |
| Binary Tree Right Side View | Medium | 69.5% |
| Flatten Nested List Iterator | Medium | 65.6% |
| Binary Tree Maximum Path Sum | Hard | 42.0% |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.8% |
| Number of Provinces | Medium | 70.0% |
| Number of Increasing Paths in a Grid | Hard | 57.4% |
| Longest Increasing Path in a Matrix | Hard | 56.3% |
| Unit Conversion I | Medium | 54.3% |
| Nested List Weight Sum | Medium | 85.9% |
| Surrounded Regions | Medium | 44.8% |
| Course Schedule | Medium | 50.8% |
| Amount of Time for Binary Tree to Be Infected | Medium | 65.1% |
| Count Ways to Build Rooms in an Ant Colony | Hard | 51.1% |
| Cousins in Binary Tree | Easy | 59.1% |
| Pacific Atlantic Water Flow | Medium | 60.6% |
| Trim a Binary Search Tree | Medium | 66.6% |
| Boundary of Binary Tree | Medium | 47.9% |
| Reconstruct Itinerary | Hard | 44.3% |
| Max Area of Island | Medium | 73.8% |
| Detonate the Maximum Bombs | Medium | 49.9% |
| Accounts Merge | Medium | 60.9% |
| Smallest Common Region | Medium | 68.3% |
| Alien Dictionary | Hard | 37.1% |
| Cheapest Flights Within K Stops | Medium | 41.4% |
| Mini Parser | Medium | 42.0% |
| Making A Large Island | Hard | 56.3% |
| Number of Operations to Make Network Connected | Medium | 66.2% |
| Network Delay Time | Medium | 59.8% |
| Critical Connections in a Network | Hard | 59.3% |
| Path Sum IV | Medium | 62.8% |
| Binary Tree Inorder Traversal | Easy | 79.7% |
| Number of Ways to Assign Edge Weights I | Medium | |
| Balanced Binary Tree | Easy | 57.9% |
| Symmetric Tree | Easy | 60.8% |
| Serialize and Deserialize Binary Tree | Hard | 60.4% |
| Same Tree | Easy | 66.7% |
| Course Schedule II | Medium | 55.0% |
| All Nodes Distance K in Binary Tree | Medium | 67.4% |
| Flood Fill | Easy | 67.9% |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% |
| Diameter of Binary Tree | Easy | 65.1% |
| Concatenated Words | Hard | 49.7% |
| Web Crawler | Medium | 68.8% |
| Maximum Width of Binary Tree | Medium | 45.3% |
| Lowest Common Ancestor of a Binary Search Tree | Medium | 70.1% |
| Binary Tree Preorder Traversal | Easy | 75.2% |
| Validate Binary Search Tree | Medium | 35.4% |
| Clone Graph | Medium | 64.7% |
| Recover Binary Search Tree | Medium | 58.8% |
| Detect Cycles in 2D Grid | Medium | 52.5% |
| Evaluate Division | Medium | 64.0% |
| Find if Path Exists in Graph | Easy | 54.8% |
| Recover a Tree From Preorder Traversal | Hard | 83.2% |
| Jump Game III | Medium | 66.7% |
| Minimum Height Trees | Medium | 42.4% |
| House Robber III | Medium | 55.6% |
| Distribute Coins in Binary Tree | Medium | 77.3% |
| Minimum Depth of Binary Tree | Easy | 52.4% |
| Path Sum III | Medium | 46.3% |
| Most Stones Removed with Same Row or Column | Medium | 62.7% |
| Maximum Level Sum of a Binary Tree | Medium | 70.0% |
| Balance a Binary Search Tree | Medium | 86.3% |
| Flatten a Multilevel Doubly Linked List | Medium | 62.6% |
| Design Add and Search Words Data Structure | Medium | 48.2% |
| Find Eventual Safe States | Medium | 70.3% |
| Flatten Binary Tree to Linked List | Medium | 70.2% |
| Two Sum IV - Input is a BST | Easy | 63.0% |
| Battleships in a Board | Medium | 77.4% |
| All Paths From Source to Target | Medium | 83.5% |
| Redundant Connection | Medium | 67.3% |
| Is Graph Bipartite? | Medium | 58.9% |
| Invert Binary Tree | Easy | 79.8% |
| Maximum Product of Splitted Binary Tree | Medium | 55.5% |
| Serialize and Deserialize BST | Medium | 59.4% |
| Minimum Absolute Difference in BST | Easy | 59.2% |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.3% |
| Island Perimeter | Easy | 74.3% |
| Possible Bipartition | Medium | 52.4% |
| Count Good Nodes in Binary Tree | Medium | 73.8% |
| Smallest String Starting From Leaf | Medium | 61.1% |
| Path Sum II | Medium | 61.8% |
| Time Needed to Inform All Employees | Medium | 60.4% |
| Delete Nodes And Return Forest | Medium | 72.5% |
| Populating Next Right Pointers in Each Node | Medium | 66.9% |
| Find Closest Node to Given Two Nodes | Medium | 53.0% |
| Minimum Fuel Cost to Report to the Capital | Medium | 64.9% |
| Subtree of Another Tree | Easy | 51.3% |
| Path Sum | Easy | 54.5% |
| Lexicographical Numbers | Medium | 76.2% |
| Average of Levels in Binary Tree | Easy | 74.7% |
| Range Sum of BST | Easy | 87.6% |
| Merge BSTs to Create Single BST | Hard | 38.0% |
| Kth Smallest Element in a BST | Medium | 76.5% |
| Number of Connected Components in an Undirected Graph | Medium | 64.8% |