smallest-unique-subarray

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 integer array <code>nums</code>.

Find the minimum length of a subarray that is not identical to any other subarray in <code>nums</code>.

Return an integer denoting the minimum possible length of such a subarray.

Two subarrays are considered identical if they have the same length and the same elements in corresponding positions.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [3,3,3]

Output: 3

Explanation:

<ul>
	<li>Subarrays of length 1: <code>[3]</code> &rarr; appears 3 times</li>
	<li>Subarrays of length 2: <code>[3, 3]</code> &rarr; appears 2 times</li>
	<li>Subarrays of length 3: <code>[3, 3, 3]</code> &rarr; appears once</li>
</ul>

The subarray <code>[3, 3, 3]</code> is unique, so the smallest unique subarray length is 3.
</div>

Example 2:

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

Output: 1

Explanation:

Subarrays of length 1:

<ul>
	<li><code>[2]</code> &rarr; appears 2 times</li>
	<li><code>[1]</code> &rarr; appears once</li>
	<li><code>[3]</code> &rarr; appears 2 times</li>
</ul>
The subarray <code>[1]</code> is unique, so the smallest unique subarray length is 1.</div>

Example 3:

<div class="example-block">
Input: nums = [1,1,2,2,1]

Output: 2

Explanation:

Subarrays of length 1:

<ul>
	<li><code>[1]</code> &rarr; appears 3 times</li>
	<li><code>[2]</code> &rarr; appears 2 times</li>
</ul>

Subarrays of length 2:

<ul>
	<li><code>[1, 1]</code> &rarr; appears once</li>
	<li><code>[1, 2]</code> &rarr; appears once</li>
	<li><code>[2, 2]</code> &rarr; appears once</li>
	<li><code>[2, 1]</code> &rarr; appears once</li>
</ul>
There is at least one subarray of length 2 that is unique, so the smallest unique subarray length is 2.</div>

&nbsp;
Constraints:

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

Weekly Contest 502

weekly-contest-502

smallestUniqueSubarray

Senior Staff

Smallest Unique Subarray

Array

Hash Table

Binary Search

Rolling Hash

Suffix Array

Hash Function

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs

You are given an integer array nums.

Find the minimum length of a subarray that is not identical to any other subarray in nums.

Return an integer denoting the minimum possible length of such a subarray.

Two subarrays are considered identical if they have the same length and the same elements in corresponding positions.

 

Example 1:

Input: nums = [3,3,3]

Output: 3

Explanation:

 * Subarrays of length 1: [3] → appears 3 times
 * Subarrays of length 2: [3, 3] → appears 2 times
 * Subarrays of length 3: [3, 3, 3] → appears once

The subarray [3, 3, 3] is unique, so the smallest unique subarray length is 3.

Example 2:

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

Output: 1

Explanation:

Subarrays of length 1:

 * [2] → appears 2 times
 * [1] → appears once
 * [3] → appears 2 times

The subarray [1] is unique, so the smallest unique subarray length is 1.

Example 3:

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

Output: 2

Explanation:

Subarrays of length 1:

 * [1] → appears 3 times
 * [2] → appears 2 times

Subarrays of length 2:

 * [1, 1] → appears once
 * [1, 2] → appears once
 * [2, 2] → appears once
 * [2, 1] → appears once

There is at least one subarray of length 2 that is unique, so the smallest unique subarray length is 2.

 

Constraints:

 * 1 <= nums.length <= 105
 * 1 <= nums[i] <= 105