Longest Increasing Subsequence

Problem

Return the length of the longest strictly increasing subsequence.

Examples

Example 1

Input: [10,9,2,5,3,7,101,18]

Output: 4

Example 2

Input: [4,3,2,1]

Output: 1

Input and output use JSON-compatible values. For linked-list and tree questions, arrays represent the node structure as described above. Your code should implement solve(input).

Write your solutionImplement solve(input). Your draft is saved in this browser.

Compiler

How to solve Longest Increasing Subsequence

Return the length of the longest strictly increasing subsequence. Maintain the smallest possible tail for subsequences of each length. The reference implementation illustrates this approach; check the example and edge cases.

Time and space complexity

O(n log n) time and O(n) space.

Practise and improve

Choose JavaScript, TypeScript or Python, complete the starter code, then select Run Tests. Request a hint when you need guidance, or choose View solution and confirm if you would like to study the reference implementation.