input: from typing import List
  
  def can_be_divided(nums: List[int]) -> bool:
      """
      This function receives an integer array nums of even length. The requirement is to divide the array into two segments nums1 and nums2 such that:
  
      nums1.length == nums2.length == nums.length / 2.
      nums1 must have unique elements.
      nums2 must also have unique elements.
  
      Return true if such a split is feasible, or false if it isn't.
  
      Example:
      >>> 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
  
      def can_be_divided(nums: List[int]) -> bool:
          count = Counter(nums)
          unique_count = sum(1 for v in count.values() if v == 1)
          duplicates = sum(v // 2 for v in count.values())
          
          return unique_count + duplicates >= len(nums) // 2
  