Easy Greedy Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    int find_len(int num){\n        int ret = 0;\n        while(num > 0){\n            ret++;\n            num /= 10;\n        }\n\n        return ret;\n    }\n    vector<string> splitMessage(string s, int limit) {\n        if(limit <= 4) return {};\n        int n = s.size();\n        for(int i = 1; i <= 4; i++){\n            int k = 1;\n            int ind = 0;\n            while(ind < n){\n                int len = find_len(k);\n                if(len > i) break;\n                int rem = limit - i - len - 3;\n                ind += rem;\n                k++;\n            }\n            if(ind >= n){\n                vector<string> ans;\n                int ind = 0;\n                for(int i = 1; i < k; i++){\n                    int len = limit - find_len(i) - find_len(k-1) - 3;\n                    len = min(len, n - ind);\n                    string str = s.substr(ind, len);\n                    str += \'<\';\n                    str += to_string(i);\n                    str += \'/\';\n                    str += to_string(k-1);\n                    str += \'>\';\n                    ans.push_back(str);\n\n                    ind += len;\n                }\n                return ans;\n            }\n        }\n\n        return {};\n    }\n};\n```
['String', 'Greedy', 'C++']