You are given a string word and an integer numFriends.

The string word is split into numFriends non empty contiguous substrings such that concatenating them in order produces word.

Return the lexicographically largest substring that can appear among all possible valid splits.

Constraints:

• $1 \leq$ word.length $\leq 5 imes 10^3$

• word consists only of lowercase English letters.

• $1 \leq$ numFriends $\leq$ word.length

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.