3403. Find the Lexicographically Largest String From the Box I

You are given a string word, and an integer numFriends.

Alice is organizing a game for her numFriends friends. There are multiple rounds in the game, where in each round:

• word is split into numFriends non-empty strings, such that no previous round has had the exact same split.
• All the split words are put into a box.

Find the lexicographically largest string from the box after all the rounds are finished.

Example 1:

Example 2:

Constraints:

• 1 <= word.length <= 5 * 103
• word consists only of lowercase English letters.
• 1 <= numFriends <= word.length