Groups
Category
Tree DP solves matching, vertex cover, and independent set on trees in linear time using small state transitions per node.
The Longest Increasing Subsequence (LIS) is the longest sequence you can extract from an array while keeping the original order and making each next element strictly larger.