Practice problems across 75+ categories
Practice problems frequently asked at Tree • 252 problems | 41 Easy | 150 Medium | 60 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 181 | Minimum Score After Removals on a Tree | Hard | ArrayBit ManipulationTree |
| 182 | Minimum Time to Collect All Apples in a Tree | Medium | Hash TableTreeDepth-First Search |
| 183 | Minimum Weighted Subgraph With the Required Paths II | Hard | ArrayTreeDepth-First Search |
| 184 | Most Frequent Subtree Sum | Medium | Hash TableTreeDepth-First Search |
| 185 | Most Profitable Path in a Tree | Medium | ArrayTreeDepth-First Search |
| 186 | Move Sub-Tree of N-Ary Tree | Hard | TreeDepth-First Search |
| 187 | N-ary Tree Level Order Traversal | Medium | TreeBreadth-First Search |
| 188 | N-ary Tree Postorder Traversal | Easy | StackTreeDepth-First Search |
| 189 | N-ary Tree Preorder Traversal | Easy | StackTreeDepth-First Search |
| 190 | Number of Good Leaf Nodes Pairs | Medium | TreeDepth-First SearchBinary Tree |
| 191 | Number of Good Paths | Hard | ArrayHash TableTree |
| 192 | Number of Nodes in the Sub-Tree With the Same Label | Medium | Hash TableTreeDepth-First Search |
| 193 | Number of Nodes With Value One | Medium | ArrayTreeDepth-First Search |
| 194 | Number of Ways to Assign Edge Weights I | Medium | MathTreeDepth-First Search |
| 195 | Number of Ways to Assign Edge Weights II | Hard | ArrayMathDynamic Programming |
Powerful online tools to boost your productivity
Coding Ground For Developers
Code, Edit, Run and ShareIgnite your coding potential on Coding Ground - an immersive online platform for hands-on learning, collaboration, and skill development.
