Skip to main content
Longest Increasing Subsequence | AlgoCracked
AlgoCracked
ProblemsLongest Increasing Subsequence
Medium54.0% acceptance
Blind75Dynamic ProgrammingArrayBinary Search

Longest Increasing Subsequence

Given an integer array nums , return the length of the longest strictly increasing subsequence . A subsequence keeps the original order but need not be contiguous. Input format Input is a single array, e.g. [[10,9,2,5,3,7,101,18]] .

Loading workspace…