Longest Increasing Subsequence

Given an integer array `nums`, return the length of the longest strictly increasing subsequence. ### Constraints - `1 <= nums.length <= 2500` - `-10^4 <= nums[i] <= 10^4` ### Input Format A single line containing space-separated integers representing `nums`. ### Output Format Print the length of the longest increasing subsequence.