About This Pattern
Master the Dynamic Programming (LIS) pattern by practicing these problems organized by difficulty.Focus on the Key Signals - these are the indicators that tell you when to use this pattern.
Medium (1)
Longest Increasing Subsequence
Find length of longest strictly increasing subsequence.
Key Signals:
dp[i] = max length ending at iCheck all previousO(n²) or O(n log n) with binary search