mediumArrayCountingHash Table 0 views
Count Special Triplets
You are given an integer array nums.
You are given an integer array nums.
A special triplet is defined as a triplet of indices (i, j, k) such that:
Return the total number of special triplets in the array.
Since the answer may be large, return it modulo 10^9 + 7.
Example 1
Input: nums = [6,3,6]
Output: 1
Explanation: The only special triplet is (i, j, k) = (0, 1, 2) , where:
Example 2
Input: nums = [0,1,0,0]
Output: 1
Explanation: The only special triplet is (i, j, k) = (0, 2, 3) , where:
Example 3
Input: nums = [8,4,2,8,4]
Output: 2
Explanation: There are exactly two special triplets:
Constraints
- 3 <= n == nums.length <= 10^5
- 0 <= nums[i] <= 10^5
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.