Python (Simple Two Pointers)
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```\nclass Solution:\n    def minimumScore(self, s, t):\n        def scan(s,t):\n            ans, i = [0], 0\n\n            for c in s:\n                if i < len(t) and t[i] == c:\n                    i += 1\n                ans.append(i)\n\n            return ans\n\n        r1 = scan(s,t)\n        r2 = reversed(scan(s[::-1],t[::-1]))\n        max_val = max([i+j for i,j in zip(r1,r2)])\n\n        return max(0,len(t)-max_val)\n\n        \n\n        \n\n\n\n\n\n\n\n        \n```
['Python3']