Dynamic programming|| Beats 100%
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 {\n    public long countAlternatingSubarrays(int[] nums) {\n        int n = nums.length;\n        int[] dp = new int[n]; \n        long count = 1; \n        \n        dp[0] = 1; \n        \n        for (int i = 1; i < n; i++) {\n            if (nums[i] != nums[i - 1]) {\n                \n                dp[i] = dp[i - 1] + 1;\n            } else {\n               \n                dp[i] = 1;\n            }\n            count += dp[i];\n        }\n        \n        return count;\n    }\n}\n\n```
['Dynamic Programming', 'Java']