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

Implement the following function: Code should be written in python.

2. count_fred_and_ted Given a list of strings called names , count up how many of those names are either "fred" or "ted", and return the count. Sample calls should look like: >>> count_fred_and_ted(["sarah", "bimmy", "fred", "eliza", "ted", "ted"]) 3 >> count_fred_and_ted(["sarah", "bimmy", "bimmy", "bimmy", "bimmy"]) >>> count_fred_and_ted(["fred", "ted", "fred", "ted"]) 4 >>> count_fred_and_ted([])

Please help! There is a bug in my program that causes it to jump to the notfound function before checking the entire substring The program should determine whether the second string is a substring of the first. If it is, then the program should print out the first index in which the second string appears in the first. As an example, if the first string is “Hello World” and the second string is “lo”, then the program should print out 3, i.e. the starting index of “lo” in “Hello World.” If the second string is not contained in the first string, then the program should print out -1. Here is the code:  .datastr1: .space 51 #space for str1 (max50 characters including null terminator)str2: .space 51 #space for str2 (max50 characters incl null terminator)msg1: .asciiz "Please enter the first string: " #prompt user to enter str1msg2: .asciiz "Please enter the second string: " #prompt user to enter str2newline: .asciiz "\n" .text.globl mainmain:    # Print sttr1    li $v0, 4    la $a0, msg1…

// Write a function that takes 1 argument, a string. // It returns true if the string is a palindrome (the same forwards and backwards). // It returns false if the string is not a palindrome. const isPalindrome = (string) => { // your code here... // Examples isPalindrome("cat") // returns false //isPalindrome("level") // returns true }

Please follow all the steps given

C++ is my answer correct ? Write a function to convert a given string : Answer: #include <iostream> #include <string> using namespace std;   void toUpper(string &str) {         for (int i = 0; i < str.length(); i++)     {         str[i] = toupper(str[i]);     } }   void toLower(string &str) {        for (int i = 0; i < str.length(); i++)     {         str[i] = tolower(str[i]);     } }   int main() {     string str = "khaled";     toUpper(str);     cout << str << endl;       str = "MOHAMMED";     toLower(str);     cout << str << endl;       return 0; }   Write a function to calculate the sum of the even number from 1 - 100. Answer: #include <iostream> using namespace std;   int sumEven() {        int sum = 0;           for (int i = 1; i <= 100; i++) {                 if (i % 2 == 0) {                         sum += i;         }     }     return sum; } int main() {     cout << sumEven() << endl;     return 0; }

Complete the rotate_text() function that takes 2 parameters, a string data and an integer n. If n is positive, then the function will shift all the characters in data forward by n positions, with characters at the end of the string being moved to the start of the string. If n is 0 then the text remains the same. For example: rotate_text('abcde', rotate_text('abcde', rotate_text('abcde', 1) would return the string 'eabcd' 3) would return the string 'cdeab' 5) would return the string 'abcde' rotate_text('abcde', 6) would return the string 'eabcd' ... and so on. If n is negative, then the function will shift the characters in data backward by n positions, with characters at the start of the string being moved to the end of the string. For example: rotate text('abcde', -1) would return the string 'bcdea'

Write a program that removes all spaces from the given input. Ex: If the input is: Hello my name is John. the output is: HellomynameisJohn. Your program must define and call the following function. The function should return a string representing the input string without spaces.string RemoveSpaces(string userString) #include <iostream>#include <algorithm>using namespace std; string removeSpaces(string str) { str.erase(remove(str.begin(), str.end(), ' '), str.end()); return str; } /* Define your function here */ int main() {string str; str = removeSpaces(str); cout << str << endl; /* Type your code here. Your code must call the function. */ return 0;} Please help me with this problem using c++.

The function count_contains_og in python takes a list of strings and returns how many strings in the list contain 'og' / 'OG' / 'oG' / 'Og' (check for 'og', ignoring case). Hint: Use the sequence membership operator in to help you check for 'og' in the individual strings. Create a lower-cased version of the string (lower), then use the in operator. For example: Test Result str_list = ['cat', 'dog', 'FROG', 'monkey'] print(count_contains_og(str_list)) 2 strlist = ["X", "x"] print(count_contains_og(strlist)) 0 list_of_one_og = ["Doggie"] print(count_contains_og(list_of_one_og)) 1