<filename>problems/dp/Solution673.py
"""   Given an integer array nums, return the number of longest increasing
   subsequences. Example 1: Input: nums = [1,3,5,4,7] Output: 2 
   
   Explanation: The
   two longest increasing subsequences are [1, 3, 4, 7] and [1, 3, 5, 7]
"""

class Solution673:
    pass
