Skip to content

3934. Smallest Unique Subarray

Description

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

Solutions

Solution 1

1


1


1


1

Comments