Write a function that gets two strings, str1 and str2, and searches for str2 inside str1, and returns the index of the first appearance of str2 in str1. If str is not in str, the function returns -1. For example: - str_find("Hello world", "llo") should return 2. - str_find("ABCDEFD", "DE") should return 3. - str_find("ABCDEFD", "BCF") should return -1. // finds the first appearance of str in str1 // returns the index of the beginning of the first appearance // if str2 is not in str1, returns -1 int str_find(const char* str1, const char* str2); Test for the Function: void test_q1() { intans1 = str_find("Hello world", "llo"); if (ans1 == 2) printf("Q1-1 ok\n"); else printf("Q1-1 ERROR\n"); intans2 = str_find("ABCDEFG", "BCF"); if (ans2 == -1) printf("Q1-2 ok\n"); else printf("Q1-2 ERROR\n"); }

Complete the function ratio_similarity, which computes the ratio of "similarity" between two non-empty strings. The ratio is computed as follows: 2 (the number of matches of characters) / (total number of characters in both strings) The matches are determined in pairwise fashion. For example, consider the strings abcdef and abdce. The three characters at indexes 0, 1 and 4 match. Therefore, the similarity ratio is 2 * 3/(6 + 5) = 0.5454 .... Examples: Function Call string_similarity('abcdef', 'abdce') string_similarity('dragon', 'flagon') string_similarity('stony', 'stony') string_similarity('Stony Brook University', 'WolfieNet Secure') string_similarity('yabba dabba doo', 'bippity boppity boo') string_similarity('Wolfie the Seawolf', "What's...a Seawolf?") [ ] Return Value 3 4 5 # Test cases 6 print (string_similarity('abcdef', 'abdce')) 7 print (string_similarity('dragon' 1 'flagon')) 'stony')) 0.5454545454545454 0.6666666666666666 1.0 0.0 0.058823529411764705 0.4864864864864865 1...

Write the convert_word code. convert_word is known as a function, which we will cover more in depth later. You are automatically given a parameter called word, which is a string that contains a single word. The return conv is how you will send data out of your function. The conv is a variable that hasn't been created yet, but it will be a string containing the converted hey. For example, if word="hey", then conv will be "heey". You are responsible for creating the variable conv, as the template has NOT done that for you. You need to use an if statement to see if the word starts with "he" and ends with "y". Since you don't know how many e's might be between the he and y, you have to do some math here. Recall that you can get the length of a string by using len(word) in the code above. You also know that h and y will be included. so, len(word) - 2 will be the number of e's in between the h and y. Create a string that contains the number of e's. This will be your conv variable. I would...

1. What does the following code segment return assuming the argment passed is a single word or short phrase def mystery3(word: str) -> str:output = ""for char in word:output = char + outputreturn output 2. Write a function called removeVowels that accepts a string as a parameter and return a copy of that string with no vowels (aeiou) in it. Upper case and lower case vowels will be remove and the rest of the string is not changed. For example removeVowels("The Quick Brown Fox) would return "Th Qck Brwn Fx"

Write a function devowel which takes a string as an argument and returns a new string that is a copy of the original with all the vowels removed (upper and lower case). Note: you will need to malloc space for this new string! For example: Test char str[]="hello"; char dvs devowel (str); printf("%s/%s",str, dvs); Result hello/hll

The function find_max_char takes one string parameter, mystr. The function returns the character in mystr with the maximum ordinal value (the character that comes last in the ASCII alphabet, relative to the other characters in mystr). However, if mystr is the empty string, the function returns the Python object None. Notice that we don't need the ord() function to compare ordinal values; we can use comparison operators. For example, "Z" > "C" is true because Z comes after C in the ASCII alphabet. We need to "accumulate" the correct answer (max_char) and then return it: First, if mystr is empty, return None Then initialize max_char (accumulator variable) to the first character in mystr Use a for loop to iterate ch over the characters in mystr Each time a new maximum character is found (if ch > max_char), max_char is updated to "remember" that the new maximum is ch Finally, return max_char For example: Test Result print(find_max_char("naproxen")) x...

Problem: Substring Pattern Matching Input: A text string t and a pattern string p Output: Does t contain the pattern p as a substring, and if so, where? For example: with t= abaababbaba, p = abba, your function should return 5. int findmatch(char *p, char *t) { int plen = strlen(p); // len of string int tlen = strlen(t); // len of string t //TODO: your code } Analyze your algorithm: what is the big O?

Create a function that takes a string and returns the number of alphanumeric characters that occur more than once. Examples duplicateCount("abcde") duplicateCount("aabbcde") → 2 duplicateCount("Indivisibilities") - duplicateCount("Aa") 0 // Case sensitive N

code should be python: write a function that allows the input of a list of strings as its only parameter. Inside the body of the function find the first palindromic word and return it. If there is no such word, it should return an empty string. A string is palindromic if it reads the same forward and backward so for example If we call the function with ["horse", "rat", "roar", "dad", "mom"], the returned value should be "dad". Note that "mom" is also a palindrome, but it is not the first one.

in python pls

PYTHON Complete the function below, which takes two arguments: data: a list of tweets search_words: a list of search phrases The function should, for each tweet in data, check whether that tweet uses any of the words in the list search_words. If it does, we keep the tweet. If it does not, we ignore the tweet. data = ['ZOOM earnings for Q1 are up 5%', 'Subscriptions at ZOOM have risen to all-time highs, boosting sales', "Got a new Mazda, ZOOM ZOOM Y'ALL!", 'I hate getting up at 8am FOR A STUPID ZOOM MEETING', 'ZOOM execs hint at a decline in earnings following a capital expansion program'] Hint: Consider the example_function below. It takes a list of numbers in numbers and keeps only those that appear in search_numbers. def example_function(numbers, search_numbers): keep = [] for number in numbers: if number in search_numbers(): keep.append(number) return keep def search_words(data, search_words):

Write a function named encode_string(sentence) that takes a string value as its input and returns an encoded string, where each character of the input string is replaced by its ASCII code plus 3 values. Whitespace characters should not be encoded. For example, if the function was passed the input string: Hello World then it should return: Khoor Zruog For example: Test sentence "Hello World" print (encode_string(sentence)) Result Khoor Zruog

Implement the following C function: repeatChars take in a null-terminated string as an argument and returns a newly- allocated null-terminated string that repeats every character in the input string. For example, repeatChars(''abcd'' )=''aabbccdd'' . You may use the strlen function to determine the length of the string your implementation does not need to check whether malloc returns NULL C Your implementation should not modify the input string