Simple Word Filter 1. Create a function that would accept two inputs: a sentence(string), and a list containing bad words that the user would like to censor but not remove. The function should return the newly filtered sentence wherein the bad words are replaced with asterisks equal to the length of the censored word.

Simple Word Filter 1. Create a function that would accept two inputs: a sentence(string), and a list containing bad words that the user would like to censor but not remove. The function should return the newly filtered sentence wherein the bad words are replaced with asterisks equal to the length of the censored word.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 18PE

See similar textbooks

Similar questions

Write a function letter_count that accepts a string txt and returns a list containing the number of times that each letter of the alphabet occurs within txt. The returned list should contain the number of occurences of all twenty-six letters of the Latin alphabet, counting both upper and lower-case instances. For example, the string 'Abacus' contains two instances of the letter 'a', and so the first element of the returned list would be 2
Given a list of integers, implement a function that returns a list of all the subsets of the input list, where each subset is represented as a list of integers.
Write a function that takes a list removal(L), delete from it all the elements whose indicesare divisible by 3. And return the resulting list after removing unwanted elements.Example:>>>removal(['A', 'B', 'C', 'D', 'E'])['B', 'C','E'
Create a function that takes each value of the averaged sequence and passes itthrough the mathematical function if x (the averaged value) is not equal to 5 andreturns 0 if x is equal to 5. These values are returned into a new list. f(x) = 1/x-5
Implement a function findMixedCase in Python that: accepts a single argument, a list of words, and returns the index of the first mixed case word in the list, if one exists, (a word is mixed case if it contains both upper and lower case letters), and returns -1 if the all words are either upper or lower case. sample: >> findMixedCase( ['Hello','how','are','you'] ) # 'Hello' is mixed case0
Complete the examples in the docstring and then write the body of thefollowing function:def same_first_last(L):""" (list) -> boolPrecondition: len(L) >= 2Return True if and only if first item of the list is the same as thelast.>>> same_first_last([3, 4, 2, 8, 3])True>>> same_first_last(['apple', 'banana', 'pear'])>>> same_first_last([4.0, 4.5])"""
Using Swift programming language, write a function filter that takes a predicate and a list as arguments and returns a list of only those elements that satisfy the predicate. Example: (filter odd? '(1 2 3 4 5 6 7 8 9)) ==> (1 3 5 7 9) Please include a screenshot of the source code and output. Thank you!!
Write a function (Ocaml) that takes an ’a list and an int list of values and returns second list, with its integers values replaced by the values from the first vector at the position specified by the integer (indexing starts with 0). Large and negative numbers are to be skipped.
Write a function REMOVE-NUM that takes a list and returns a list consisting of the original list with all numeric atoms removed. Examples: (REMOVE-NUM '(2 A 6 B 1 C 7 D)) returns the list (A B C D) (REMOVE-NUM '(3 A 4 B (1 E) 7 D)) returns the list (A B (E) D)
Suppose we have a singly linked list implemented with the structure below and a function that takes in the head of the list.typedef struct node{int num;struct node* next;} node;int whatDoesItDo (node * head){struct node * current = head;struct node * other, *temp;if (current == NULL)return head;other = current->next;if (other == NULL)return head;other = other->next;temp = current->next;current->next = other->next;current = other->next;if (current == NULL){head->next = temp;return head;}other->next = current->next;current->next = temp;return head;}If we call whatDoesItDo(head) on the following list, show the list after the function has finished.head -> 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7
Write a function removeN which takes three arguments called N, E and L (where L is a list) and returns a list equal to L but with the first N occurrences of E in that list removed. Note: only first N occurrences of E must be removed, not all occurrences! If there are less than N occurrences of E in the list, then all occurrences of E should be removed. Using scheme language Test Result (removeN 2 'a '(a b a c a d a)) (b c a d a) (removeN 4 'a '(a b a c a d a)) (b c d)
Write a function sum67 that takes a list as an input parameter and returns the sum of the numbers in the list, except ignore sections of numbers starting with a 6 and extending to the next 7 (every 6 will be followed by at least one 7). Return 0 for no numbers.