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:

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".

def answerString(self, word: str, numFriends: int) -> str:
	if numFriends == 1:
		return word

	n = len(word)
	length = n - numFriends + 1
	max_char = max(word)
	result = ""

	for i in range(n):
		if word[i] == max_char:
			substr = word[i:i + length]
			result = max(result, substr)

	return result