Easy Solution || Beginner Friendly✔✔✔ || Easy Concept ☠☠☠
Complexity\n- Time complexity: O(NLogN)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(1)\n Add your space complexity here, e.g. O(n) \n\n
# Complexity\n- Time complexity: O(NLogN)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public boolean isPossibleToSplit(int[] nums) {\n        java.util.Arrays.sort(nums);\n        int curr = nums[0];\n        int count = 1;\n        for(int i = 1 ; i < nums.length ; i++)\n        {\n            if(nums[i] == curr)\n            {\n                count++;\n            }\n            else\n            {\n                count = 1;\n                curr = nums[i];\n            }\n            if(count > 2)\n            {\n                return false;\n            }\n        }\n        return true;        \n    }\n}\n```
['Java']