🎓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#cp-tp3-002
1850

Unique Pairwise GCD Path

Phase 3 / tree-gcd

treeGCDpathcounting
Custom#P016
1800

Longest Path With Type Alternation

Phase 2 / Tree DP

treedppath
Custom#P010
1800

Pairwise Minimum Path Sum

Phase 2 / Tree, Path Queries

treepathpairwisemin
Custom#P002
1800

Tree Rerooting Value

Phase 2 / Tree DP, Rerooting

treererootingdp
Custom#p018
2150

Balanced Subtree Queries

Phase 1 / tree, dfs, dp

treedpdfssubtree
Custom#p014
1700

Tree Diameter After Edge Addition

Phase 1 / tree, diameter, greedy

treediametergraphgreedy
Custom#p008
2300

Kth Smallest in Path

Phase 1 / tree, lca, path_query

treelcapath queryorder statistics
Custom#ct-p6-03
2400

Centroid Nearest Active

Phase 6 / combined-techniques

treecentroiddata-structure
Custom#ct-p2-03
1700

Subtree Token Harvest

Phase 2 / tree-dp-intro

treedfsdpinduction
12