mediumEnumerationStringTwo Pointers 0 views

Find the Lexicographically Largest String From the Box I

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

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:

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

Find the Lexicographically Largest String From the Box I diagram

Example 1

Input: word = "dbca", numFriends = 2

Output: "dbc"

Explanation: All possible splits are:

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^3
  • word consists only of lowercase English letters.
  • 1 <= numFriends <= word.length

Hints

Companies

No companies reported yet.

Discussion

Sign in to join the discussion.

Loading discussion...

Test results

No test cases yet.