hardArrayCombinatoricsDynamic ProgrammingMathPrefix Sum 0 views
Find the Count of Monotonic Pairs I
You are given an array of positive integers nums of length n.
You are given an array of positive integers nums of length n.
We call a pair of non-negative integer arrays (arr1, arr2) monotonic if:
Return the count of monotonic pairs.
Since the answer may be very large, return it modulo 10^9 + 7.
Example 1
Input: nums = [2,3,2]
Output: 4
Explanation: The good pairs are:
Example 2
Input: nums = [5,5,5,5]
Output: 126
Constraints
- 1 <= n == nums.length <= 2000
- 1 <= nums[i] <= 50
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.