Given a string s, return the last substring of s in lexicographical order.
 
Example 1:
Input: "abab"
Output: "bab"
Explanation: The substrings are ["a", "ab", "aba", "abab", "b", "ba", "bab"]. The lexicographically maximum substring is "bab".

Example 2:
Input: "leetcode"
Output: "tcode"

 
Note:

1 <= s.length <= 4 * 10^5
s contains only lowercase English letters.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "# class Solution:\n#     def lastSubstring(self, s: str) -> str:\n        \n        \n#         stack = []\n#         dic = {}\n#         for i in 'abcdefghijklmnopqrstuvwxyz':\n#             dic[ord(i)] = i\n#         right = 0\n#         while right < len(s):\n#             if not stack:\n#                 stack.append(ord(s[right]))\n#             else:\n#                 if ord(s[right]) > stack[0]:\n#                     stack = []\n#                 elif ord(s[right]) == stack[0]:\n#                     index = 0\n#                     while right + index < len(s) and index < len(stack):\n#                         if ord(s[right+index]) > stack[index]:\n#                             stack = []\n#                             break\n#                         elif ord(s[right+index]) < stack[index]:\n#                             break\n                        \n#                         index += 1\n#                 stack.append(ord(s[right]))\n#             right += 1\n            \n        \n#         res = ''\n        \n#         for i in stack:\n#             res += dic[i]\n            \n#         return res\n\nclass Solution:\n    def lastSubstring(self, s: str) -> str:\n        if not s: return None\n        ## get max char from s\n        maxC, N = max(s),len(s)\n        ## get max char indexs to append into inds\n        ## only store the first ind for consecutive max chars\n        inds = [i for i in range(N) if s[i]==maxC and (i==0 or s[i-1]!=maxC)]\n        maxind = inds[0] # starting index of the max substring\n       \n        ## using for loop to compare with each substring lead by max char\n        for i in range(1,len(inds)):\n            curind = inds[i] # start index of current substring\n            step = 0 # index pointer from start index\n            ## compare the current sub with the max sub string\n            while curind+step<N:\n                if s[curind+step]>s[maxind+step]: # current sub larger than maxsub\n                    maxind = curind\n                    break\n                elif s[curind+step]==s[maxind+step]:\n                    step += 1\n                else: # s[curind+step]<s[maxind+step]: # current sub smaller than maxsub\n                    break\n                \n        return s[maxind:]"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'lastSubstring'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 5803