You are given a string message and an integer limit.

You need to split message into $k$ parts such that each part is appended with a suffix formatted as "<i/k>", where:

• k represents the total number of parts into which the message is divided.

• i represents the $1$ based index of the current part, satisfying $1 \leq i \leq k$.

The splitting must satisfy the following conditions:

• The total length of each part, including its appended suffix, is at most limit.

• Concatenating the contents of all $k$ parts (excluding their suffixes) in order reconstructs the original message.

• The total number of parts $k$ is minimized.

Return an array of strings representing the split parts in order. If it is impossible to split message to satisfy all conditions, return an empty array.

Constraints:

• $1 \leq$ message.length $\leq 10^4$

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

• $1 \leq$ limit $\leq 10^4$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.