Acontiguous subsequence of a list s is a subsequence made up of consecutive elements of s. for instance, if s is 5,15,-30,10,-5,40,10,then 15,-30,10 is contiguous subsequence but 5,15,40 is not. give an o(n) time algorithm for the following task : -
input : - a list of numbers a1,a2,

Print "censored" if userinput contains the word "darn", else print userinput. end with newline. ex: if userinput is "that darn cat.", then output is: censoredex: if userinput is "dang, that was scary! ", then output is: dang, that was scary! note: if the submitted code has an out-of-range access, the system will stop running the code after a few seconds, and report "program end never reached." the system doesn't print the test case that caused the reported message.#include #include using namespace std; int main() {string userinput; getline(cin, userinput); int ispresent = userinput.find("darn"); if (ispresent > 0){cout < < "censored" < < endl; /* your solution goes here */return 0; }