/* [Challenge] Annoying Words Have you ever used “heelllloooo”, “hiiiiii”, “heeyyy” in your message? Please don’t do that, these are annoying words. Let’s call these words S. Annoying words have groups of repeated characters, for example: “h”, “ee”, “lll”, “ooo”. These annoying words are derived from their basic forms, and there can be multiple of them. A word is basic if it can be made into S using these procedures: - Choose a group of characters c - Add some numbers of character c to the group until there are at least (K) characters of c Given a string S, an array of words W, and K, how many words in W that can be derived into S? Input: S = “booobbyyy” W = [“bobby”, “bob”, “boby”] K = 3 Output: 1 Explanation: Only “bobby” is the basic word. Choose ‘o’ and ‘y’ and add 2 characters each. We can’t extend “boby”, because S doesn’t have at least K letter ‘b’ (the 2nd b). Input: S = “bbbbbbhhhh” W = [“bbbbhhhh”, “bbhhhh”, “bbbhhh”, “bbbbbbbhhhh”] K = 5 Output: 2 Please do it in 1 pass for each word in W. https://www.sololearn.com/post/437585/?ref=app */ #include #include #include using namespace std; int main() { auto fix_annoying = [](string const S, vectorconst& W, size_t const K) { return count_if(W.cbegin(), W.cend(), [=](string const w) { if(S.size() < K or S.size() < w.size()) return false; char const* sptr {S.c_str()}; char const* wptr {w.c_str()}; bool can_expand = false; size_t sc, wc; while(*sptr ) { if(*sptr != *wptr) return false; sc = 1; char c{*wptr}; sptr++; while(*sptr == c) {++sc; ++sptr;} if(sc < K) can_expand = false; else can_expand = true; wc = 1; ++wptr; while(*wptr == c) {++wc; ++wptr;} if(wc > sc) return false; if(!can_expand && sc != wc) return false; } return true ; }); }; cout << fix_annoying("booobbyyy", { "bobby", "bob", "boby","hello" }, 3) << '\n'; cout << fix_annoying("bbbbbbhhhh", {"bbbbhhhh", "bbhhhh", "bbbhhh"}, 5) << '\n'; }

[Challenge] Annoying Words.cpp