Leetcode 673. Number of Longest Increasing Subsequence

Count how many strictly increasing subsequences of maximum possible length exist in the given array. The core challenge is tracking, for each element, the length of the longest increasing subsequence ending there and the number of ways to achieve that length (n ≤ 2000).