#+ANKI_DECK: study_deck_02
* TODO 0300. Longest Increasing Subsequence :medium:
:PROPERTIES:
:NEETCODE: [[file:../../roadmap.org::*0300. Longest Increasing Subsequence][0300. Longest Increasing Subsequence]]
:END:

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

*Example 1:*


#+begin_src
Input: nums = [10,9,2,5,3,7,101,18]
Output: 4
Explanation: The longest increasing subsequence is [2,3,7,101], therefore the length is 4.
#+end_src


*Example 2:*


#+begin_src
Input: nums = [0,1,0,3,2,3]
Output: 4
#+end_src


*Example 3:*


#+begin_src
Input: nums = [7,7,7,7,7,7,7]
Output: 1
#+end_src


*Constraints:*

 - ~1 <= nums.length <= 2500~

 - ~-10^{4} <= nums[i] <= 10^{4}~

Follow up: Can you come up with an algorithm that runs in ~O(n log(n))~ time complexity?

** TODO Approach
Write your approach here.

** TODO Python
#+begin_src python
class Solution:
    def lengthOfLIS(self, nums: List[int]) -> int:
#+end_src

** TODO C++
#+begin_src cpp
class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        
    }
};
#+end_src