Create 2799. Count Complete Subarrays in an Array (#776)

Author: Chayandas07

2799. Count Complete Subarrays in an Array

@@ -0,0 +1,20 @@
+class Solution {
+public:
+    int countCompleteSubarrays(vector<int>& nums) {
+        unordered_map<int, int> m, m1;
+        for(int ele : nums) m[ele]++;
+        int n = nums.size();
+        int distinct = m.size();  // total distinct elements in nums
+        int cnt = 0;
+        
+        for(int i = 0; i < n; i++) {
+            for(int j = i; j < n; j++) {
+                m1[nums[j]]++;
+                if(m1.size() == distinct) cnt++;
+            }
+            m1.clear();
+        }
+        
+        return cnt;
+    }
+};