[C++] Super Short O(n) 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```\nclass Solution {\npublic:\n    int minimumScore(string s, string t) {\n        int s_sz = s.size(), t_sz = t.size(), suffix[100002]{}, res = t_sz;\n        for(int i = s_sz-1, j = t_sz-1; i >= 0; i--) {\n            if(j >= 0 && s[i] == t[j]) suffix[i] = t_sz - j--;\n            else suffix[i] = suffix[i+1];\n        }\n        for(int i = 0, j = 0; i <= s_sz; i++) {\n            res = min(res,  t_sz - min(t_sz, j + suffix[i]));\n            if(i < s_sz && s[i] == t[j]) j++;\n        }\n        return res;\n    }\n};\n```
['C++']