Practice problems across 75+ categories
Practice problems frequently asked at Tree • 252 problems | 41 Easy | 150 Medium | 60 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 151 | Maximize the Number of Target Nodes After Connecting Trees I | Medium | TreeDepth-First SearchBreadth-First Search |
| 152 | Maximize the Number of Target Nodes After Connecting Trees II | Hard | TreeDepth-First SearchBreadth-First Search |
| 153 | Maximum Average Subtree | Medium | TreeDepth-First SearchBinary Tree |
| 154 | Maximum Binary Tree | Medium | ArrayDivide and ConquerStack |
| 155 | Maximum Binary Tree II | Medium | TreeBinary Tree |
| 156 | Maximum Depth of Binary Tree | Easy | TreeDepth-First SearchBreadth-First Search |
| 157 | Maximum Depth of N-ary Tree | Easy | TreeDepth-First SearchBreadth-First Search |
| 158 | Maximum Difference Between Node and Ancestor | Medium | TreeDepth-First SearchBinary Tree |
| 159 | Maximum Good Subtree Score | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 160 | Maximum Level Sum of a Binary Tree | Medium | TreeDepth-First SearchBreadth-First Search |
| 161 | Maximum Number of K-Divisible Components | Hard | TreeDepth-First Search |
| 162 | Maximum Points After Collecting Coins From All Nodes | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 163 | Maximum Product of Splitted Binary Tree | Medium | TreeDepth-First SearchBinary Tree |
| 164 | Maximum Profit from Trading Stocks with Discounts | Hard | ArrayDynamic ProgrammingTree |
| 165 | Maximum Score After Applying Operations on a Tree | Medium | Dynamic ProgrammingTreeDepth-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.
