Easy solution
IntuitionApproachComplexity

Time complexity:
O(n)


Space complexity:
O(n)

Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
O(n)

- Space complexity:
O(n)

# Code
```java []
class Solution {
    public boolean isPossibleToSplit(int[] nums) {
        if (nums.length % 2 != 0) {
            return false;
        }

        Map<Integer, Integer> map = new HashMap<>();

        for (int i = 0; i < nums.length; i++) {
            if (map.containsKey(nums[i])) {
                map.put(nums[i], map.get(nums[i]) + 1);

                //Only 2 duplicates needed to get 2 arrays with distinct elements
                if (map.get(nums[i]) > 2) {
                    return false;
                }
            } else {
                map.put(nums[i], 1);
            }
        }

       return true; 
    }
}
```
['Hash Table', 'Java']