LIS

1 problem using this pattern

About this pattern:

A useful algorithmic pattern for solving coding problems efficiently.

Often used with: Dynamic Programming

Complexity Range

Time Complexity

O(n²) (1 problem)

Space Complexity

O(n) (1 problem)

Problems Using LIS

Longest Increasing Subsequence

Find the length of the longest strictly increasing subsequence.

Hard LeetCode
Time: O(n²)
Space: O(n)
Example: [10,9,2,5,3,7,101,18] → 4
Dynamic Programming LIS
View Solution →
← Back to All Patterns
View All Categories