Count Special Triplets - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
3583. Count Special Triplets
Medium
30 Points
Array
Hash Table
Counting
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 109 + 7.
Examples
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 <= 105
0 <= nums[i] <= 105
3583. Count Special Triplets
Medium
30 Points
Array
Hash Table
Counting
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 109 + 7.
Examples
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: