Simple Suffix Array Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python3 []\nclass Solution:\n    def validSequence(self, s: str, t: str) -> List[int]:\n        if(len(t)==1):\n            return [0]\n        n=len(s)\n        suffix=[-1]*(len(t))\n        l=len(t)-1\n        for i in range(n-1,-1,-1):\n            if(s[i]==t[l]):\n                suffix[l]=i\n                l-=1\n            if(l<0):\n                break\n        print(suffix)\n        res=[]\n        flag=0\n        l=0\n        for i in range(n):\n            if(s[i]==t[l]):\n                res.append(i)\n                l+=1\n            elif(flag==0 and (l==len(t)-1 or i+1<=suffix[l+1])):\n                flag=1\n                res.append(i)\n                l+=1\n            if(l==len(t)):\n                return res\n        return []\n\n\n            \n\n        \n```
['Python3']