Using HashMap = easy
IntuitionStep 1: Count the frequency of each number in nums using a HashMap.
Step 2: Check if any number appears more than twice. If yes, return false.
Step 3:
# Intuition
Step 1: Count the frequency of each number in nums using a HashMap.
Step 2: Check if any number appears more than twice. If yes, return false.
Step 3: If the number of unique elements is at least nums.length / 2, return true; otherwise, return false.

# Code
```java []
class Solution {
    public static boolean isPossibleToSplit(int[] nums) {
    	
    	HashMap<Integer, Integer>hm =  new HashMap<Integer, Integer>();
    	
    	for (int i = 0; i < nums.length; i++) {
			hm.put(nums[i], hm.getOrDefault(nums[i], 0)+1);
		}
    	
    	for(Integer a : hm.keySet()) {
    		
    		if(hm.get(a) > 2) {
    			return false;
    		}
    	}
    	
    	return true;
    }
}
```
['Java']