maximum-equal-frequency

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an array <code>nums</code> of positive integers, return the longest possible length of an array prefix of <code>nums</code>, 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&#39;s still considered that every appeared number has the same number of ocurrences (0).

&nbsp;
Example 1:

<pre>
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.
</pre>

Example 2:

<pre>
Input: nums = [1,1,1,2,2,2,3,3,3,4,4,4,5]
Output: 13
</pre>

&nbsp;
Constraints:

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

maxEqualFreq

Maximum Equal Frequency

Remove Letter To Equalize Frequency

remove-letter-to-equalize-frequency

删除字符使频率相同

Count Submatrices With Equal Frequency of X and Y

count-submatrices-with-equal-frequency-of-x-and-y

统计 X 和 Y 频数相等的子矩阵数量

Array

Hash Table

给你一个正整数数组&nbsp;<code>nums</code>，请你帮忙从该数组中找出能满足下面要求的 最长 前缀，并返回该前缀的长度：

<ul>
	<li>从前缀中 恰好删除一个 元素后，剩下每个数字的出现次数都相同。</li>
</ul>

如果删除这个元素后没有剩余元素存在，仍可认为每个数字都具有相同的出现次数（也就是 0 次）。

&nbsp;

示例 1：

<pre>
输入：nums = [2,2,1,1,5,3,3,5]
输出：7
解释：对于长度为 7 的子数组 [2,2,1,1,5,3,3]，如果我们从中删去 nums[4] = 5，就可以得到 [2,2,1,1,3,3]，里面每个数字都出现了两次。
</pre>

示例 2：

<pre>
输入：nums = [1,1,1,2,2,2,3,3,3,4,4,4,5]
输出：13
</pre>

&nbsp;

提示：

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