Longest Increasing Subsequence

📝 Description

Find length of longest strictly increasing subsequence

Input Format

Array of integers

Output Format

Length of LIS

Constraints

1 ≤ nums.length ≤ 2500

🔍 Sample Input

[10,9,2,5,3,7,101,18]
            

✅ Sample Output

4