input: Write a python function that checks if a given integer array nums of even length can be split into two subarrays, nums1 and nums2, such that both subarrays have the same length (nums.length / 2) and contain distinct elements. The function should return true if the array can be split accordingly and false otherwise.
  
  from typing import List
  
  def can_split_array(nums: List[int]) -> bool:
      """
      This function determines whether an integer array of even length can be divided into two subarrays of equal length, each containing unique elements.
  
      Examples:
      >>> nums = [1,1,2,3,3,4]
      true
      >>> nums = [2,2,2,2]
      false
  
      Constraints:
      1 <= len(nums) <= 100
      len(nums) % 2 == 0
      1 <= nums[i] <= 100
      """
output: def can_split_array(nums: List[int]) -> bool:
      count = {}
      for num in nums:
          if num in count:
              count[num] += 1
          else:
              count[num] = 1
                  
      max_freq = max(count.values())
      return len(nums) // 2 >= max_freq