Solving Unique Number of Occurrences in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Example 1:

Input: arr = [1,2,2,1,1,3]
Output: true
Explanation: The value 1 has 3 occurrences, 2 has 2 and 3 has 1. No two values have the same number of occurrences.

Example 2:

Input: arr = [1,2]
Output: false

Example 3:

Input: arr = [-3,0,1,-3,1,1,1,-3,10,0]
Output: true

Constraints:

  • -1000 <= arr[i] <= 1000

  • 1 <= arr.length <= 1000

  • -1000 <= arr[i] <= 1000

See the full details of the problem Unique Number of Occurrences at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go