You are given an integer array nums.
Consider all pairs of distinct values x and y from nums such that:
x < yx and y have different frequencies in nums.Among all such pairs:
x.x, choose the one with the smallest possible value of y.Return an integer array [x, y]. If no valid pair exists, return [-1, -1].
Example 1:
Input: nums = [1,1,2,2,3,4]
Output: [1,3]
Explanation:
The smallest value is 1 with a frequency of 2, and the smallest value greater than 1 that has a different frequency from 1 is 3 with a frequency of 1. Thus, the answer is [1, 3].
Example 2:
Input: nums = [1,5]
Output: [-1,-1]
Explanation:
Both values have the same frequency, so no valid pair exists. Return [-1, -1].
Example 3:
Input: nums = [7]
Output: [-1,-1]
Explanation:
There is only one value in the array, so no valid pair exists. Return [-1, -1].
Constraints:
1 <= nums.length <= 1001 <= nums[i] <= 100Solutions for this problem are being prepared.
Try solving it yourselfPractice Smallest Pair With Different Frequencies with our built-in code editor and test cases.
Practice on FleetCodePractice this problem
Open in Editor