smallest-pair-with-different-frequencies

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer array <code>nums</code>.

Consider all pairs of distinct values <code>x</code> and <code>y</code> from <code>nums</code> such that:

<ul>
	<li><code>x &lt; y</code></li>
	<li><code>x</code> and <code>y</code> have different frequencies in <code>nums</code>.</li>
</ul>

Among all such pairs:

<ul>
	<li>Choose the pair with the smallest possible value of <code>x</code>.</li>
	<li>If multiple pairs have the same <code>x</code>, choose the one with the smallest possible value of <code>y</code>.</li>
</ul>

Return an integer array <code>[x, y]</code>. If no valid pair exists, return <code>[-1, -1]</code>.

&nbsp;
Example 1:

<div class="example-block">
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 <code>[1, 3]</code>.
</div>

Example 2:

<div class="example-block">
Input: nums = [1,5]

Output: [-1,-1]

Explanation:

Both values have the same frequency, so no valid pair exists. Return <code>[-1, -1]</code>.
</div>

Example 3:

<div class="example-block">
Input: nums = [7]

Output: [-1,-1]

Explanation:

There is only one value in the array, so no valid pair exists. Return <code>[-1, -1]</code>.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 100</code></li>
</ul>