Practice. Submit. Improve.

Problem Library

371 coding challenges available

0/371Solved

StatusTitleAcceptanceDifficultySave

○ 1.Campus Department Path RunHeavy-Light Decomposition · Path Queries — Easy

○ 2.Game Skill Type Path RunHeavy-Light Decomposition · Path Queries — Easy

○ 3.Supply Network Product-Class RunHeavy-Light Decomposition · Path Queries — Easy

○ 4.Family Tree Consecutive Trait RunHeavy-Light Decomposition · Path Queries — Easy

○ 5.Power Grid Same-Type Path RunHeavy-Light Decomposition · Path Queries — Easy

○ 6.Supply Chain Route Segment ReversalMaximum Subarray · Path Processing — Hard

○ 7.Family Tree Value Route RepairMaximum Subarray · Path Processing — Hard

○ 8.Power Grid Inspection Route ReversalMaximum Subarray · Path Processing — Hard

○ 9.Campus Walk Sequence ReversalMaximum Subarray · Path Processing — Hard

○ 10.Game Skill Tree Route ReversalMaximum Subarray · Path Processing — Hard

○ 11.Family Tree Closest Repeated TraitHeavy-Light Decomposition · Range Structures — Easy

○ 12.Power Line Path Best Profit SegmentHeavy-Light Decomposition · Range Structures — Easy

○ 13.Campus Path Distinct Department CountHeavy-Light Decomposition · Range Structures — Easy

○ 14.Game Skill Tree Maximum Pair XORHeavy-Light Decomposition · Range Structures — Easy

○ 15.Closest Equal Labels on a Tree PathHeavy-Light Decomposition · Label Compression — Easy

○ 16.Tree Path Maximum Segment After One SwapDynamic Programming · Maximum Subarray — Hard

○ 17.Maximum Subarray on a Tree PathHeavy-Light Decomposition · Segment Tree — Easy

○ 18.Nearest Active Tree NodeCentroid Decomposition · Dynamic Queries — Easy