Leetcode 300. Longest Increasing Subsequence

medium — apple interview question

Problem

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

Input: nums = [10,9,2,5,3,7,101,18]
Output: 4
Explanation: The longest increasing…