AVS
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    long long countAlternatingSubarrays(vector<int>& a) {\n        long long ans=0,sum=1;\n        for(int i=1;i<a.size();i++){\n            if(a[i]!=a[i-1])sum++;\n            else{\n                ans+=((sum*(sum+1))/2);\n                sum=1;\n            }\n        }\n        ans+=((sum*(sum+1))/2);\n                sum=1;\n        return ans;\n    }\n};\n```
['C++']