input: from typing import List
  
  def find_count_of_alternating_subarrays(nums: List[int]) -> int:
      """
      Given a binary array nums, count the number of alternating subarrays.
      A subarray is considered alternating if no two adjacent elements within it are identical.
      
      Return the amount of alternating subarrays in nums.
  
      Examples:
      >>> nums = [0,1,1,1]
      5
      >>> nums = [1,0,1,0]
      10
  
      Constraints:
      1 <= nums.length <= 10^5
      nums[i] is either 0 or 1.
      """
output:     
      n = len(nums)
      count = 0
      
      for i in range(n):
          for j in range(i+1, n+1):
              subarray = nums[i:j]
              if all(subarray[k] != subarray[k+1] for k in range(len(subarray) - 1)):
                  count += 1
                  
      return count
  