Practice problems across 75+ categories
Practice problems frequently asked at Tree • 252 problems | 41 Easy | 150 Medium | 60 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 106 | Find Root of N-Ary Tree | Medium | Hash TableBit ManipulationTree |
| 107 | Find Subtree Sizes After Changes | Medium | ArrayHash TableString |
| 108 | Find the Last Marked Nodes in Tree | Hard | TreeDepth-First Search |
| 109 | Find the Level of Tree with Minimum Sum | Medium | TreeDepth-First SearchBreadth-First Search |
| 110 | Find the Maximum Sum of Node Values | Hard | ArrayDynamic ProgrammingGreedy |
| 111 | Find Weighted Median Node in Tree | Hard | ArrayBinary SearchDynamic Programming |
| 112 | Flatten Binary Tree to Linked List | Medium | Linked ListStackTree |
| 113 | Flatten Nested List Iterator | Medium | StackTreeDepth-First Search |
| 114 | Flip Binary Tree To Match Preorder Traversal | Medium | TreeDepth-First SearchBinary Tree |
| 115 | Flip Equivalent Binary Trees | Medium | TreeDepth-First SearchBinary Tree |
| 116 | Frog Position After T Seconds | Hard | TreeDepth-First SearchBreadth-First Search |
| 117 | Height of Binary Tree After Subtree Removal Queries | Hard | ArrayTreeDepth-First Search |
| 118 | Height of Special Binary Tree | Medium | TreeDepth-First SearchBreadth-First Search |
| 119 | House Robber III | Medium | Dynamic ProgrammingTreeDepth-First Search |
| 120 | Increasing Order Search Tree | Easy | StackTreeDepth-First Search |
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.
