You are given an integer array nums.
Return an integer denoting the first element (scanning from left to right) in nums whose frequency is unique. That is, no other integer appears the same number of times in nums. If there is no such element, return -1.
Example 1:
Input: nums = [20,10,30,30]
Output: 30
Explanation:
Example 2:
Input: nums = [20,20,10,30,30,30]
Output: 20
Explanation:
Example 3:
Input: nums = [10,10,20,20]
Output: -1
Explanation:
Constraints:
1 <= nums.length <= 1051 <= nums[i] <= 105Solutions for this problem are being prepared.
Try solving it yourselfPractice First Element with Unique Frequency with our built-in code editor and test cases.
Practice on FleetCodePractice this problem
Open in Editor