Easy Solution with frequency approach
IntuitionHere our intution is to make distinct numbers in each array the count in each array should not be >1 i.e count in original array  should not be >2.Appr
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->
Here our intution is to make distinct numbers in each array the count in each array should not be >1 i.e count in original array  should not be >2.

# Approach
<!-- Describe your approach to solving the problem. -->
Creating a Frequency array to count frequency of nummbers, if the freq is >2 retrun false else return true.

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

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

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

        for(int k: nums){
            f[k]++;
        }
        for(int k: f){
            if(k>2)return false;
        }
    return true;
    }
}
```
['Java']