input: from typing import List
  
  def can_split_array(nums: List[int]) -> bool:
      """
      Given an integer array nums of even size, determine whether it can be divided into two subarrays nums1 and nums2 such that:
  
      nums1.size == nums2.size == nums.size / 2.
      nums1 contains unique elements.
      nums2 also contains unique elements.
  
      Return true if the array can be split accordingly, false otherwise.
  
      Examples:
      >>> nums = [1, 1, 2, 2, 3, 4]
      true
      >>> nums = [1, 1, 1, 1]
      false
  
      Constraints:
      1 <= nums.size <= 100
      nums.size % 2 == 0
      1 <= nums[i] <= 100
      """
output:     
      from collections import Counter
  
      count = Counter(nums)
      num_single_occurrences = sum(1 for v in count.values() if v == 1)
      total_elements = len(nums)
  
      if num_single_occurrences > total_elements // 2:
          return False
  
      return True
  