TP
IntuitionApproachComplexity
Time complexity:

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

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

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public boolean isPossibleToSplit(int[] nums) {
        HashMap<Integer, Integer> freq = new HashMap<>();
        int i = 0;
        if (nums.length % 2 != 0) 
                return false;
            while (i < nums.length) {
                if (!freq.containsKey(nums[i])){
                    freq.put(nums[i],1);
                } else if (freq.containsKey(nums[i])) {
                   Integer val= freq.get(nums[i]);
                   freq.put(nums[i],val+1);
                } 
                if (freq.get(nums[i])>2) {
                    return false;
                }
                i++;
            }

        return true;
    }
}
```
['Java']