Number of Longest Increasing Subsequence

Explore how to use dynamic programming to determine the number of longest strictly increasing subsequences in an array. Understand the problem constraints, and practice implementing efficient solutions that handle subsequence counting with optimized approaches.