2799 Count Complete Subarrays in an Array

2799 Count Complete Subarrays in an Array. This Java code uses two-pointer (sliding window) technique
to count the number of complete subarrays. If there is only one distinct element then you can
return triangular number of n.
Explanation:
First, find the total number of distinct elements in the entire array.
If there's only one distinct element, the answer is the total number of subarrays, which is n*(n+1)/2
Otherwise, use a sliding window to find subarrays that contain all distinct elements.
For each valid window left, right that contains all distinct elements, all subarrays starting at left
and ending at any index from right to n-1 are complete.
We add n - right to the count and then move left forward to find other subarrays.

Видео 2799 Count Complete Subarrays in an Array канала Fogy Free