Find the Lexicographically Largest String From the Box I | Leetcode 3403

class Solution {
public:
    string answerString(string word, int numFriends) {
        int n = word.size();
        if(numFriends==1)   return word;

        int i = 0;
        int j = 1;
        int gap = 0;

        //Find largest suffix
        while(j+gap < n){
            if(word[i+gap]==word[j+gap])    gap++;
            else if(word[i+gap]<word[j+gap]){
                int save = i;
                i = j;
                j = max(j+1,save+gap+1);
                gap = 0;
            }else{
                j = j+gap+1;
                gap = 0;
            }
        }
        return word.substr(i,n-numFriends+1);
    }
};
/*
//JAVA
class Solution {
    public String answerString(String word, int numFriends) {
        int n = word.length();
        if (numFriends == 1) return word;

        int i = 0;
        int j = 1;
        int gap = 0;

        // Find largest suffix
        while (j + gap < n) {
            if (word.charAt(i + gap) == word.charAt(j + gap)) {
                gap++;
            } else if (word.charAt(i + gap) < word.charAt(j + gap)) {
                int save = i;
                i = j;
                j = Math.max(j + 1, save + gap + 1);
                gap = 0;
            } else {
                j = j + gap + 1;
                gap = 0;
            }
        }
        return word.substring(i, i + n - numFriends + 1);
    }
}

#python
class Solution:
    def answerString(self, word: str, numFriends: int) -> str:
        n = len(word)
        if numFriends == 1:
            return word

        i = 0
        j = 1
        gap = 0

        # Find largest suffix
        while j + gap < n:
            if word[i + gap] == word[j + gap]:
                gap += 1
            elif word[i + gap] < word[j + gap]:
                save = i
                i = j
                j = max(j + 1, save + gap + 1)
                gap = 0
            else:
                j = j + gap + 1
                gap = 0
        return word[i:i + n - numFriends + 1]
*/