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:
[3] → appears 3 times[3, 3] → appears 2 times[3, 3, 3] → appears onceThe 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[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 timesSubarrays of length 2:
[1, 1] → appears once[1, 2] → appears once[2, 2] → appears once[2, 1] → appears onceConstraints:
1 <= nums.length <= 1051 <= nums[i] <= 105Loading editor...
[3,3,3]