Number of Longest Increasing Subsequence
Try to solve the Number of Longest Increasing Subsequence problem.
We'll cover the following...
Statement
Given an integer array nums, return the number of longest strictly increasing subsequences it contains.
A subsequence is formed by choosing elements from the array while keeping their original order, and it is considered strictly increasing if every next element is greater than the previous one.
Constraints:
...
Ask