| 1 |
Add One Row to Tree |
Medium |
TreeDepth-First SearchBreadth-First Search |
| 2 |
Alien Dictionary |
Hard |
ArrayStringDepth-First Search |
| 3 |
All Ancestors of a Node in a Directed Acyclic Graph |
Medium |
Depth-First SearchBreadth-First SearchGraph |
| 4 |
All Elements in Two Binary Search Trees |
Medium |
TreeDepth-First SearchBinary Search Tree |
| 5 |
All Nodes Distance K in Binary Tree |
Medium |
Hash TableTreeDepth-First Search |
| 6 |
All Paths From Source to Target |
Medium |
BacktrackingDepth-First SearchBreadth-First Search |
| 7 |
Amount of Time for Binary Tree to Be Infected |
Medium |
Hash TableTreeDepth-First Search |
| 8 |
Apply Substitutions |
Medium |
ArrayHash TableString |
| 9 |
Array Nesting |
Medium |
ArrayDepth-First Search |
| 10 |
Average of Levels in Binary Tree |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 11 |
Balance a Binary Search Tree |
Medium |
Divide and ConquerGreedyTree |
| 12 |
Balanced Binary Tree |
Easy |
TreeDepth-First SearchBinary Tree |
| 13 |
Battleships in a Board |
Medium |
ArrayDepth-First SearchMatrix |
| 14 |
Binary Search Tree to Greater Sum Tree |
Medium |
TreeDepth-First SearchBinary Search Tree |
| 15 |
Binary Tree Cameras |
Hard |
Dynamic ProgrammingTreeDepth-First Search |