Easy JAVA Solution
\n- Time complexity: O(n)\n- Space complexity: O(n)\n\n\nclass Solution {\n    public boolean isPossibleToSplit(int[] nums) {\n        \n        int n=nums.leng
\n- Time complexity: O(n)\n- Space complexity: O(n)\n\n```\nclass Solution {\n    public boolean isPossibleToSplit(int[] nums) {\n        \n        int n=nums.length;\n        Map<Integer,Integer> map=new HashMap<>();\n        for(int i=0;i<n;i++)\n        {\n            map.put(nums[i],map.getOrDefault(nums[i],0)+1);\n        }\n        int freq=0;\n        for(Map.Entry<Integer,Integer> m:map.entrySet())\n        {\n            if(m.getValue()>2) return false;\n            else if(m.getValue()==1) freq++;      \n        }\n        \n        return freq%2==0?true:false;\n        \n    }\n}\n```
['Java']