Number of Longest Increasing Subsequence

Explore how to count the number of longest strictly increasing subsequences within an integer array by applying dynamic programming. Understand the problem constraints, develop a clear approach, and implement an efficient solution to optimize your coding interview preparation.