Find the Lexicographically Largest String From Box II

Explore how to determine the lexicographically largest substring formed by splitting a string into unique parts based on the number of friends in a game. Understand using the two pointers technique for efficient string manipulation and practice implementing solutions to handle multiple rounds of unique splits.

We'll cover the following...

Statement
Examples
Understand the problem
Figure it out!
Try it yourself

Statement

You are given a string, word, and an integer numFriends, representing the number of friends participating in a game organized by Alice.

The game consists of multiple rounds, and in each round:

The string word is split into exactly numFriends non-empty substrings.
The split must be unique; no previous round has produced the same sequence of splits.
All resulting substrings from the split are placed into a box.

When all rounds are over and all possible unique splits have been performed, determine the lexicographically largest string among all the substrings in the box.

A string $a$ is considered lexicographically larger than a string $b$ ...