2645. Minimum Additions to Make Valid String

Given a string word to which you can insert letters “a”, “b” or “c” anywhere and any number of times, return the minimum number of letters that must be inserted so that word becomes valid.

A string is called valid if it can be formed by concatenating the string “abc” several times.

class Solution {
public:
    int addMinimum(string word) {
        int res = 0, p = 0;
        string abc = "abc";
        for(auto w : word) {
            while(abc[p] != w) {
                res += 1;
                p = (p + 1) % 3;
            }
            p = (p + 1) % 3;
        }
        while(p != 0) {
            res += 1;
            p = (p + 1) % 3;
        }
        return res;
    }
};