Count Complete Subarrays in an Array
You are given an array nums consisting of positive integers.
We call a subarray of an array complete if the following condition is satisfied:
- The number of distinct elements in the subarray is equal to the number of distinct elements in the whole array.
Return the number of complete subarrays.
A subarray is a contiguous non-empty part of an array.
Example 1
Input
nums = [1,3,1,2,2]Output
4The complete subarrays are [1,3,1,2], [1,3,1,2,2], [3,1,2], and [3,1,2,2].
Example 2
Input
nums = [5,5,5,5]Output
10The array consists only of the integer 5, so any subarray is complete, giving 10 subarrays.
Constraints
- 1 <= nums.length <= 1000
- 1 <= nums[i] <= 2000
Asked at 4 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.