DrawCode

Longest Increasing Subsequence

Find the longest strictly increasing subsequence using patience-sorting or DP in O(n log n) or O(n²).

Browse free without an account. Sign in to save progress, sync likes, and open your canvas workspace.