Last Substring in Lexicographical Order LeetCode solution in Python

1
# Runtime: 273 ms (Top 82.1%) | Memory: 20.15 MB (Top 100.0%)
2

3

4
class Solution:
5
    def lastSubstring(self, s: str) -> str:
6
        i = 0
7
        j = 1
8
        k = 0
9
        n = len(s)
10
        while j + k < n:
11
            if s[i + k] == s[j + k]:
12
                k += 1
13
            elif s[i + k] > s[j + k]:
14
                j += k + 1
15
                k = 0
16
            elif s[i + k] < s[j + k]:
17
                i = max(i + k + 1, j)
18
                j = i + 1
19
                k = 0
20
        return s[i:]