##### Welcome to Subscribe On Youtube

Formatted question description: https://leetcode.ca/all/2468.html

# 2468. Split Message Based on Limit

• Difficulty: Hard.
• Related Topics: String, Binary Search.
• Similar Questions: Text Justification, Search a 2D Matrix, Sentence Screen Fitting.

## Problem

You are given a string, message, and a positive integer, limit.

You must split message into one or more parts based on limit. Each resulting part should have the suffix "<a/b>", where "b" is to be replaced with the total number of parts and "a" is to be replaced with the index of the part, starting from 1 and going up to b. Additionally, the length of each resulting part (including its suffix) should be equal to limit, except for the last part whose length can be at most limit.

The resulting parts should be formed such that when their suffixes are removed and they are all concatenated in order, they should be equal to message. Also, the result should contain as few parts as possible.

Return** the parts message would be split into as an array of strings. If it is impossible to split message as required, return an empty array**.

Example 1:

Input: message = "this is really a very awesome message", limit = 9
Output: ["thi<1/14>","s i<2/14>","s r<3/14>","eal<4/14>","ly <5/14>","a v<6/14>","ery<7/14>"," aw<8/14>","eso<9/14>","me<10/14>"," m<11/14>","es<12/14>","sa<13/14>","ge<14/14>"]
Explanation:
The first 9 parts take 3 characters each from the beginning of message.
The next 5 parts take 2 characters each to finish splitting message.
In this example, each part, including the last, has length 9.
It can be shown it is not possible to split message into less than 14 parts.


Example 2:

Input: message = "short message", limit = 15
Output: ["short mess<1/2>","age<2/2>"]
Explanation:
Under the given constraints, the string can be split into two parts:
- The first part comprises of the first 10 characters, and has a length 15.
- The next part comprises of the last 3 characters, and has a length 8.


Constraints:

• 1 <= message.length <= 104

• message consists only of lowercase English letters and ' '.

• 1 <= limit <= 104

## Solution (Java, C++, Python)

• class Solution {
public String[] splitMessage(String message, int limit) {
int n = message.length();
int sa = 0;
String[] ans = new String[0];
for (int k = 1; k <= n; ++k) {
int lk = (k + "").length();
sa += lk;
int sb = lk * k;
int sc = 3 * k;
if (limit * k - (sa + sb + sc) >= n) {
int i = 0;
ans = new String[k];
for (int j = 1; j <= k; ++j) {
String tail = String.format("<%d/%d>", j, k);
String t = message.substring(i, Math.min(n, i + limit - tail.length())) + tail;
ans[j - 1] = t;
i += limit - tail.length();
}
break;
}
}
return ans;
}
}

• class Solution {
public:
vector<string> splitMessage(string message, int limit) {
int n = message.size();
int sa = 0;
vector<string> ans;
for (int k = 1; k <= n; ++k) {
int lk = to_string(k).size();
sa += lk;
int sb = lk * k;
int sc = 3 * k;
if (k * limit - (sa + sb + sc) >= n) {
int i = 0;
for (int j = 1; j <= k; ++j) {
string tail = "<" + to_string(j) + "/" + to_string(k) + ">";
string t = message.substr(i, limit - tail.size()) + tail;
ans.emplace_back(t);
i += limit - tail.size();
}
break;
}
}
return ans;
}
};

• class Solution:
def splitMessage(self, message: str, limit: int) -> List[str]:
n = len(message)
sa = 0
for k in range(1, n + 1):
sa += len(str(k))
sb = len(str(k)) * k
sc = 3 * k
if limit * k - (sa + sb + sc) >= n:
ans = []
i = 0
for j in range(1, k + 1):
tail = f'<{j}/{k}>'
t = message[i : i + limit - len(tail)] + tail
ans.append(t)
i += limit - len(tail)
return ans
return []


• func splitMessage(message string, limit int) (ans []string) {
n := len(message)
sa := 0
for k := 1; k <= n; k++ {
lk := len(strconv.Itoa(k))
sa += lk
sb := lk * k
sc := 3 * k
if limit*k-(sa+sb+sc) >= n {
i := 0
for j := 1; j <= k; j++ {
tail := "<" + strconv.Itoa(j) + "/" + strconv.Itoa(k) + ">"
t := message[i:min(i+limit-len(tail), n)] + tail
ans = append(ans, t)
i += limit - len(tail)
}
break
}
}
return
}

func min(a, b int) int {
if a < b {
return a
}
return b
}


Explain:

nope.

Complexity:

• Time complexity : O(n).
• Space complexity : O(n).