| Number of Connected Components in an Undirected Graph | Medium | 64.8% | 100.0% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Number of Steps to Reduce a Number in Binary Representation to One | Medium | 63.7% | 68.6% | StringBit ManipulationSimulation |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 64.5% | Hash TableStringDesign+1 |
| Maximum Sum of 3 Non-Overlapping Subarrays | Hard | 59.7% | 59.1% | ArrayDynamic ProgrammingSliding Window+1 |
| Minimum Path Sum | Medium | 67.8% | 59.1% | ArrayDynamic ProgrammingMatrix |
| Dot Product of Two Sparse Vectors | Medium | 89.9% | 59.1% | ArrayHash TableTwo Pointers+1 |
| Widest Vertical Area Between Two Points Containing No Points | Easy | 87.1% | 51.6% | ArraySorting |
| First Missing Positive | Hard | 42.5% | 51.6% | ArrayHash Table |
| LRU Cache | Medium | 46.8% | 51.6% | Hash TableLinked ListDesign+1 |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 51.6% | StringTreeDepth-First Search+3 |
| Guess the Word | Hard | 36.9% | 51.6% | ArrayMathString+2 |