Beats 100% || C++
Complexity\n- Time complexity: O(nlogn)\n\n- Space complexity: O(1)\n\n# Code\n\nclass Solution \n{\npublic:\n    vector<int> separateDigits(vector<int>& nums) 
# Complexity\n- Time complexity: O(nlogn)\n\n- Space complexity: O(1)\n\n# Code\n```\nclass Solution \n{\npublic:\n    vector<int> separateDigits(vector<int>& nums) \n    {\n        vector<int> v;\n        for(int x=0; x<nums.size(); x++)\n        {\n            int n=nums[x];\n            int count=0;\n            while(n!=0)\n            {\n                count++;\n                n/=10;\n            }\n            n=nums[x];\n            int m=pow(10,count-1);\n            while(m!=0)\n            {\n                v.push_back(nums[x]/m);\n                nums[x]=nums[x]%m;\n                m/=10;\n            }\n        }\n        return v;\n    }\n};\n```
['C++']