Longest Increasing Subsequence (LIS)

Question Explain

Given an integer array `nums`, return the length of the longest strictly increasing subsequence. Can be solved with $O(n^2)$ DP or $O(n \log n)$ using patience sorting.