Practice problems across 75+ categories
Practice problems frequently asked at Tree • 252 problems | 41 Easy | 150 Medium | 60 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 136 | Linked List in Binary Tree | Medium | Linked ListTreeDepth-First Search |
| 137 | Logical OR of Two Binary Grids Represented as Quad-Trees | Easy | Divide and ConquerTree |
| 138 | Longest Path With Different Adjacent Characters | Hard | ArrayStringTree |
| 139 | Longest Special Path | Hard | ArrayHash TableTree |
| 140 | Longest Special Path II | Hard | ArrayHash TableTree |
| 141 | Longest Univalue Path | Medium | TreeDepth-First SearchBinary Tree |
| 142 | Longest ZigZag Path in a Binary Tree | Medium | Dynamic ProgrammingTreeDepth-First Search |
| 143 | Lowest Common Ancestor of a Binary Search Tree | Medium | TreeDepth-First SearchBinary Search Tree |
| 144 | Lowest Common Ancestor of a Binary Tree | Medium | TreeDepth-First SearchBinary Tree |
| 145 | Lowest Common Ancestor of a Binary Tree II | Medium | TreeDepth-First SearchBinary Tree |
| 146 | Lowest Common Ancestor of a Binary Tree III | Medium | Hash TableTwo PointersTree |
| 147 | Lowest Common Ancestor of a Binary Tree IV | Medium | Hash TableTreeDepth-First Search |
| 148 | Lowest Common Ancestor of Deepest Leaves | Medium | Hash TableTreeDepth-First Search |
| 149 | Make Costs of Paths Equal in a Binary Tree | Medium | ArrayDynamic ProgrammingGreedy |
| 150 | Maximize Sum of Weights after Edge Removals | Hard | 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.
