📄️ Pattern 10: Longest Increasing Subsequence (LIS)
The Ordering Pattern: Find longest subsequence where elements follow increasing order. Can be extended to multidimensional problems.
1d: Longest Increasing Subsequence Problems
The Ordering Sub-pattern: Find longest subsequence where elements follow a specific order. Still linear sequence - dp[i] = answer ending at i, but with constraint checking when looking back. Can be extended to multidimensional problems.