Counter is the !!KEY!! Beats 100% + Beginner Friendly :) 
IntuitionThe problem requires us to split the given array into two parts such that both contain distinct elements. The key observation is that if any number app
![image.png](https://assets.leetcode.com/users/images/87a83e83-0f84-4777-a5e7-6cfeddffe626_1739778366.0798821.png)

# Intuition
The problem requires us to split the given array into two parts such that both contain distinct elements. The key observation is that if any number appears more than twice, it becomes impossible to distribute it between the two subarrays while keeping both distinct.

# Approach
- ### 1. Count the occurrences of each number in nums using Counter().
- ### 2. If any number appears more than twice, return False, since it would be impossible to distribute it while maintaining distinct elements in both halves.

- ### 3. Otherwise, return True, as we can always split the array into two valid halves.

# Complexity
- Time complexity: O(n)


- Space complexity: O(n)

# Code
```python3 []
class Solution:
    def isPossibleToSplit(self, nums: List[int]) -> bool:
        counter = Counter(nums)

        for value in counter.values():
            if value > 2:
                return False

        return True
```


# Show Some Love Please if You Like :)
['Python3']