Leetcode Problem 1163. Last Substring in Lexicographical Order

1163. Last Substring in Lexicographical Order

Leetcode Solutions

Initialize i to 0, j to 1, and k to 0.
While j + k is less than the length of the string s, do the following:
- If s[i + k] == s[j + k], increment k.
- If s[i + k] < s[j + k], update i to max(i + k + 1, j), set j to i + 1, and reset k to 0.
- If s[i + k] > s[j + k], update j to j + k + 1 and reset k to 0.
Return the substring starting from i to the end of the string s.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen