Number of Longest Increasing Subsequence

Understand how to solve the problem of counting the number of longest strictly increasing subsequences in an array. Explore dynamic programming strategies to efficiently analyze subproblems and implement a solution that handles constraints effectively.