Leetcode 2799. Count Complete Subarrays in an Array

Count the number of contiguous subarrays whose set of distinct elements equals the total number of distinct elements in the entire array. The core challenge is efficiently detecting and counting windows that contain all distinct values (typically done with frequency maps and a sliding-window / two-pointer approach).