| Number of Islands | Medium | 63.8% | 83.4% |
| Binary Tree Right Side View | Medium | 69.5% | 57.7% |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.8% | 57.7% |
| All Ancestors of a Node in a Directed Acyclic Graph | Medium | 62.1% | 57.7% |
| Course Schedule | Medium | 50.8% | 55.5% |
| Diameter of Binary Tree | Easy | 65.1% | 53.1% |
| Kth Smallest Element in a BST | Medium | 76.5% | 50.3% |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 50.3% |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 50.3% |
| Validate Binary Search Tree | Medium | 35.4% | 47.1% |
| Max Area of Island | Medium | 73.8% | 43.3% |
| Word Search | Medium | 46.9% | 43.3% |
| Number of Distinct Islands | Medium | 62.7% | 43.3% |
| Course Schedule II | Medium | 55.0% | 43.3% |
| Find Leaves of Binary Tree | Medium | 81.3% | 38.7% |
| Surrounded Regions | Medium | 44.8% | 38.7% |
| Kill Process | Medium | 70.3% | 38.7% |
| Sum Root to Leaf Numbers | Medium | 69.6% | 32.9% |
| Distance to a Cycle in Undirected Graph | Hard | 74.0% | 32.9% |
| Populating Next Right Pointers in Each Node | Medium | 66.9% | 32.9% |
| Island Perimeter | Easy | 74.3% | 32.9% |
| Flatten Binary Tree to Linked List | Medium | 70.2% | 32.9% |
| All Nodes Distance K in Binary Tree | Medium | 67.4% | 32.9% |
| Clone Graph | Medium | 64.7% | 32.9% |
| Keys and Rooms | Medium | 75.5% | 32.9% |
| Number of Closed Islands | Medium | 67.0% | 32.9% |
| Path Sum II | Medium | 61.8% | 24.9% |
| Count Servers that Communicate | Medium | 73.5% | 24.9% |
| Invert Binary Tree | Easy | 79.8% | 24.9% |
| Maximum Employees to Be Invited to a Meeting | Hard | 61.8% | 24.9% |
| Nested List Weight Sum | Medium | 85.9% | 24.9% |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 24.9% |
| Boundary of Binary Tree | Medium | 47.9% | 24.9% |
| Design Add and Search Words Data Structure | Medium | 48.2% | 24.9% |
| Water and Jug Problem | Medium | 45.0% | 24.9% |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.3% | 24.9% |
| Maximum Depth of Binary Tree | Easy | 77.9% | 24.9% |
| Redundant Connection | Medium | 67.3% | 24.9% |
| Flood Fill | Easy | 67.9% | 24.9% |
| Find Minimum Diameter After Merging Two Trees | Hard | 57.1% | 24.9% |
| Path Sum III | Medium | 46.3% | 24.9% |
