2️⃣ Count Subarrays With All Distinct Elements Problem Given an array, count the number of subarrays whose number of distinct elements is equal to the total number of unique elements in the entire array. Key Concepts Sliding Window Frequency map Two pointers Exactly K distinct elements