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 ([2,3,7,101]) Input: nums=[0,1,0,3,2,3] Output: 4
Unlock hints progressively — start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features