Number of Longest Increasing Subsequence

Understand how to compute the number of longest strictly increasing subsequences within an integer array. Explore dynamic programming methods like memoization and tabulation to optimize your solution for arrays with up to 2000 elements.