maximum-frequency-after-subarray-operation

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 array <code>nums</code> of length <code>n</code>. You are also given an integer <code>k</code>.

You perform the following operation on <code>nums</code> once:

<ul>
	<li>Select a subarray <code>nums[i..j]</code> where <code>0 &lt;= i &lt;= j &lt;= n - 1</code>.</li>
	<li>Select an integer <code>x</code> and add <code>x</code> to all the elements in <code>nums[i..j]</code>.</li>
</ul>

Find the maximum frequency of the value <code>k</code> after the operation.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [1,2,3,4,5,6], k = 1

Output: 2

Explanation:

After adding -5 to <code>nums[2..5]</code>, 1 has a frequency of 2 in <code>[1, 2, -2, -1, 0, 1]</code>.
</div>

Example 2:

<div class="example-block">
Input: nums = [10,2,3,4,5,5,4,3,2,2], k = 10

Output: 4

Explanation:

After adding 8 to <code>nums[1..9]</code>, 10 has a frequency of 4 in <code>[10, 10, 11, 12, 13, 13, 12, 11, 10, 10]</code>.
</div>

&nbsp;
Constraints:

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