Number of Longest Increasing Subsequence

Explore how to solve the problem of counting the longest strictly increasing subsequences in an array. Understand the use of dynamic programming concepts such as memoization and tabulation to efficiently tackle this challenge, and practice implementing your solution in an interactive coding environment.