✅☑ Easy Java Solution | HashMap | 1ms 🔥
\n\n# Code\n\nclass Solution {\n    public boolean isPossibleToSplit(int[] nums) {\n        HashMap<Integer,Integer> table = new HashMap<>();\n        for(int i
\n\n# Code\n```\nclass Solution {\n    public boolean isPossibleToSplit(int[] nums) {\n        HashMap<Integer,Integer> table = new HashMap<>();\n        for(int i=0; i<nums.length; i++)\n        {\n            if(table.containsKey(nums[i]))\n            {\n                table.put(nums[i],table.get(nums[i])+1);\n                    if(table.get(nums[i])>2)\n                    {\n                    return false;\n                    }\n            }\n\n            else\n            {\n                table.put(nums[i],1);\n            }\n        }\n        return true;\n        \n    }\n}\n```
['Java']