Temu / Pinduoduo

Count Longest Increasing Subsequences

Members only

Given an integer array, return the number of longest increasing subsequences. For [1, 2, 3, 7, 5], the answer is 2 because [1, 2, 3, 7] and [1, 2, 3, 5] share the maximum length.