solulubeta
Sign in
NeetCode 150 / 1-D Dynamic Programming
13.11 · Problem

Longest Increasing Subsequence

Medium DP, or patience sorting with binary search 1 video LC 300 Pro

This problem is part of solulu Pro

Return the length of the longest strictly increasing subsequence of nums. A subsequence keeps the original order but may skip elements.

Lifetime ₹1,999 ₹999 · Launch offer
Mark this problem as solved when you are finished.

Item 109 of 150 · updated 2026-10-12