LeetCode 1163: Last Substring in Lexicographical Order Solution

Master LeetCode problem 1163 (Last Substring in Lexicographical Order), a hard challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

1163. Last Substring in Lexicographical Order

Hard

Two Pointers String

Problem Explanation

Explanation

To solve this problem, we can use a two-pointer approach. We start with two pointers at the beginning of the string. We compare the characters at the positions pointed by the two pointers. The pointer pointing to the character with a greater value will be moved to the next position. If the characters are equal, we need to continue comparing the characters at the subsequent positions until we find a character that is larger.

By following this approach, we will eventually find the lexicographically maximum substring in the string.

Time complexity: O(n) where n is the length of the input string s. Space complexity: O(1)

Solution Code

class Solution {
    public String lastSubstring(String s) {
        int i = 0, j = 1, k = 0;
        int len = s.length();
        
        while (j + k < len) {
            if (s.charAt(i + k) == s.charAt(j + k)) {
                k++;
                continue;
            }
            
            if (s.charAt(i + k) < s.charAt(j + k)) {
                i = j;
            }
            
            j += k + 1;
            k = 0;
        }
        
        return s.substring(i);
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 1163 (Last Substring in Lexicographical Order)?

This page provides optimized solutions for LeetCode problem 1163 (Last Substring in Lexicographical Order) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 1163 (Last Substring in Lexicographical Order)?

The time complexity for LeetCode 1163 (Last Substring in Lexicographical Order) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1163 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 1163 in Java, C++, or Python.

Back to LeetCode Solutions