<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:
        # n=len(s)
        # arr=[]
        # m=max(s)
        # k=s[s.index(m):]
        # arr=[k]
        # # print(s[s.index(k)+1:])
        # # if m in s[s.index(k)+1:]:
        # #     print(m)
        # while m in k[1:]:
        #     k=k[k.index(m):]
        #     arr.append(k)
        # print(arr)
        # out=s[s.index(m):]

        # length=len(s)
        # maxi=max(s)
        # count=0
        # arr=[]
        # for i in range(length):
        #     if maxi==s[i]:
        #         arr.append(s[i:])
        # if len(arr)==1:
        #     return arr.pop()
        # print(sorted(arr))
        # return 1 
        # return out

        result=""
        for i in range(len(s)):
            result=max(result,s[i:])
        return result
20600