Find the Lexicographically Largest String From the Box I
Medium
You receive 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:
-
wordis split intonumFriendsnon-empty texts, such that no previous round has had the exact same split. -
All the split words are put into a box.
Find the lexicographically largest text from the box after all the rounds are finished.
Example 1
Input: word = "dbca", numFriends = 2
Output: "dbc"
Explanation: All possible splits are:
-
"d"and"bca". -
"db"and"ca". -
"dbc"and"a".
Example 2
Input: word = "gggg", numFriends = 4
Output: "g"
Explanation: The only possible split is: "g" , "g" , "g" , and "g" .
Constraints
1 <= word.length <= 5 * 10^3wordconsists only of lowercase English letters.1 <= numFriends <= word.length
Did this problem appear in one of your interviews?
Responses stay private.