(Solved) : 19 Without String Problem Given Two Input Strings Base Remove Set Result Version Base Stri Q35961834 . . .
Please give me in c++language.
19 THE WITHOUT STRING PROBLEM Given two input strings, base and remove, set result to a version of the base string where all instances of the remove string have been removed. This is not case sensitive. You may assume that the remove string is length 1 or more. Remove only non-overlapping instances, so with “xxx” removing for input of “Hello there”, “llo”-“He there” for input of “Hello there”, “e” → “Hllo thr” for input of “Hello there”, “x” → “Hello there” “xx” leaves “x” 20 THE COUNT TRIPLE PROBLEM We’ll say that a “triple” in a string is a char appearing three times in a row. Set result to the number of triples in the given string. The triples may overlap. for input of abCXXXabc”–1 for input of “Xxxabyyyycd” → 3 for input of “a”0 Show transcribed image text
Expert Answer
Answer to 19 Without String Problem Given Two Input Strings Base Remove Set Result Version Base Stri Q35961834 . . .
OR