Number of Longest Increasing Subsequence

Explore how to determine the number of longest strictly increasing subsequences within an integer array. Understand the problem constraints and use dynamic programming strategies to implement an efficient solution.