Longest Increasing Subsequence (#300)

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

Company Tags: Amazon, Adobe

Core Concept: Dynamic Programming, Binary Search

Solve on LeetCode