Longest Increasing Subsequence

#300
Medium
Dynamic Programming
O(n log n)
O(n)
Microsoft
Amazon
Facebook
View on LeetCode

Problem Description

Given an integer array nums, return the length of the longest strictly increasing subsequence.