java.lang.Object
g1201_1300.s1224_maximum_equal_frequency.Solution

public class Solution extends java.lang.Object
1224 - Maximum Equal Frequency.

Hard

Given an array nums of positive integers, return the longest possible length of an array prefix of nums, such that it is possible to remove exactly one element from this prefix so that every number that has appeared in it will have the same number of occurrences.

If after removing one element there are no remaining elements, it’s still considered that every appeared number has the same number of ocurrences (0).

Example 1:

Input: nums = [2,2,1,1,5,3,3,5]

Output: 7

Explanation: For the subarray [2,2,1,1,5,3,3] of length 7, if we remove nums[4] = 5, we will get [2,2,1,1,3,3], so that each number will appear exactly twice.

Example 2:

Input: nums = [1,1,1,2,2,2,3,3,3,4,4,4,5]

Output: 13

Constraints:

  • 2 <= nums.length <= 105
  • 1 <= nums[i] <= 105
  • Constructor Summary Link icon

    Constructors
    Constructor
    Description
     
  • Method Summary Link icon

    Modifier and Type
    Method
    Description
    int
    maxEqualFreq(int[] nums)
     

    Methods inherited from class java.lang.Object Link icon

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
  • Constructor Details Link icon

    • Solution Link icon

      public Solution()
  • Method Details Link icon

    • maxEqualFreq Link icon

      public int maxEqualFreq(int[] nums)