Groups
Category
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.
Dynamic programming (DP) solves complex problems by breaking them into overlapping subproblems and using their optimal substructure.