input: from typing import List
  
  def can_divide_array(nums: List[int]) -> bool:
      """
      Given an integer array nums of even length, determine if it is possible to divide the array into two parts nums1 and nums2 such that:
  
      nums1.length == nums2.length == nums.length / 2.
      nums1 contains unique elements.
      nums2 also contains unique elements.
  
      Return true if the array can be divided this way, otherwise return false.
  
      Examples:
      >>> nums = [1,1,2,2,3,4]
      true
      >>> nums = [1,1,1,1]
      false
  
      Constraints:
      1 <= nums.length <= 100
      nums.length % 2 == 0
      1 <= nums[i] <= 100
      """
output:     from collections import Counter
      
      num_counts = Counter(nums)
      
      for count in num_counts.values():
          if count > 2:
              return False
              
      return True