🎓How I Study AIHISA
📖Read
📄Papers📰Blogs🎬Courses
💡Learn
🛤️Paths📚Topics💡Concepts🎴Shorts
🎯Practice
⏱️Coach🧩Problems🧠Thinking🎯Prompts🧠Review
SearchSettings
How I Study AI - Learn AI Papers & Lectures the Easy Way

Problems21

All SourcesLeetCodeCodeforcesBOJCustom
All LevelsEasyMediumHard
tree
Custom#cpq006-641
2200

Tree Branch Maximum Frequency

Phase 3 / tree, lca, frequency

treelcafrequencypath-query
Custom#P016-820
1700

K-Radius Tree Value Propagation

Phase 5 / tree/distance/propagation

treebfsdistance
Custom#P008-845
1800

Tree Path Maximum After Pruning

Phase 5 / trees/pruning/path_max

treegreedypruning
Custom#cpq017
1550

Rooted Subtree Maximum Path

Phase 6 / tree/dp

treedpmax-path
Custom#cpq015
1700

Tree Path Sum With Multipliers

Phase 6 / tree/path-query

treelcaqueriespath-sum
Custom#cpq008
1800

Treewise Bitwise Convolution

Phase 6 / tree/xor

treexorsubtreedfs
Custom#cpq004
1700

Edge Weight Matching

Phase 6 / dp/tree

dptreematching
Custom#cp018
2100

Colorful Path Queries

Phase 6 / tree, lca, path, color counting

treelcacoloroffline query
Custom#cp015
2100

Weighted Tree Diameter with Forbidden Vertices

Phase 6 / tree, dfs, component, diameter

treediameterdfscomponent
Custom#cp004
2300

Tree Path Maximum Excluding Subtree

Phase 6 / tree, path query, exclusion subtree

treelcapathsubtree exclusion
Custom#cp-tp3-019
2450

Subtree Maximum XOR Query

Phase 3 / tree-query

treequeryxoroffline
Custom#cp-tp3-010
2250

Binary Tree Subpath Sum XOR

Phase 3 / tree-dp

treedpxorprefix-sum
12