Find the Lexicographically Largest String From the Box I
With two or more friends, every piece is at most n minus k plus 1 letters long, so compare the windows of that length.
With two or more friends, every piece is at most n minus k plus 1 letters long, so compare the windows of that length.