Practice problems across 75+ categories
Practice problems frequently asked at Tree • 252 problems | 41 Easy | 150 Medium | 60 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 166 | Maximum Depth of N-ary Tree | Easy | TreeDepth-First SearchBreadth-First Search |
| 167 | Maximum Difference Between Node and Ancestor | Medium | TreeDepth-First SearchBinary Tree |
| 168 | Maximum Good Subtree Score | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 169 | Maximum Level Sum of a Binary Tree | Medium | TreeDepth-First SearchBreadth-First Search |
| 170 | Maximum Number of K-Divisible Components | Hard | TreeDepth-First Search |
| 171 | Maximum Points After Collecting Coins From All Nodes | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 172 | Maximum Product of Splitted Binary Tree | Medium | TreeDepth-First SearchBinary Tree |
| 173 | Maximum Profit from Trading Stocks with Discounts | Hard | ArrayDynamic ProgrammingTree |
| 174 | Maximum Score After Applying Operations on a Tree | Medium | Dynamic ProgrammingTreeDepth-First Search |
| 175 | Maximum Subtree of the Same Color | Medium | ArrayDynamic ProgrammingTree |
| 176 | Maximum Sum BST in Binary Tree | Hard | Dynamic ProgrammingTreeDepth-First Search |
| 177 | Maximum Width of Binary Tree | Medium | TreeDepth-First SearchBreadth-First Search |
| 178 | Maximum XOR of Two Non-Overlapping Subtrees | Hard | TreeDepth-First SearchGraph |
| 179 | Merge BSTs to Create Single BST | Hard | Hash TableBinary SearchTree |
| 180 | Merge Two Binary Trees | Easy | TreeDepth-First SearchBreadth-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.
