Simple C Solution (frequency method) 100%
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n1. find if any number a
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n1. find if any number appear more then twice\n# Complexity\n- Time complexity:O(n)\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```\nbool isPossibleToSplit(int* a, int n) {\n    int freq[101]={0};\n    for(int i=0;i<n;i++){\n        freq[a[i]]++;\n        if(freq[a[i]]>2){\n            return false;\n        }\n    }\n    // for(int i=0;i<101;i++){\n    //     if(freq[i]>2){\n    //         return false;\n    //     }\n    // }\n    return true;\n}\n```
['C']