<p>Given a string <code>s</code>, return <em>the last substring of</em> <code>s</code> <em>in lexicographical order</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;abab&quot;
<strong>Output:</strong> &quot;bab&quot;
<strong>Explanation:</strong> The substrings are [&quot;a&quot;, &quot;ab&quot;, &quot;aba&quot;, &quot;abab&quot;, &quot;b&quot;, &quot;ba&quot;, &quot;bab&quot;]. The lexicographically maximum substring is &quot;bab&quot;.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;leetcode&quot;
<strong>Output:</strong> &quot;tcode&quot;
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 4 * 10<sup>5</sup></code></li>
	<li><code>s</code> contains only lowercase English letters.</li>
</ul>

class Solution:
    def lastSubstring(self, s: str) -> str:
        peak_element = ord(s[0])-ord("a")
        partitioning_index = 0
        for i in range(len(s)):
            index_ele = ord(s[i])-ord("a")
            if index_ele > peak_element:
                partitioning_index = i
                peak_element = index_ele

        max_ele_index = [i for i in range(len(s)) if s[i] == s[partitioning_index]]

        res = ""

        for index in max_ele_index:
            if s[index:] > res:
                res = s[index:]
        return res

        
6925