Given string inputStr on one line, character inputChar on a second line, and integer strIndex on a third line, output "Matching" if the character at index strIndex of inputStr matches inputChar. Otherwise, output "Not matching". End with a newline. Ex: If the input is: quart u 1 then the output is: Matching Note: Assume the length of string inputStr is greater than strIndex. #include #include using namespace std;   int main() {    string inputStr; char inputChar; int strIndex;      getline(cin, inputStr); cin >> inputChar; cin >> strIndex;      /* Your code goes here */        return 0; }

Given string stringVal on one line, integer idxBegin on a second line, and integer desiredLen on a third line, output the substring of stringVal starting at position idxBegin and with length desiredLen. End with a newline. Ex: If the input is: Fuzzy bear 3 4 then the output is: zy b Note: Using a pre-defined string function, the solution can be just one line of code. #include <iostream>#include <string>using namespace std; int main() {   string stringVal;   int idxBegin;   int desiredLen;    getline(cin, stringVal);   cin >> idxBegin;   cin >> desiredLen;    /* Your code goes here */    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'

Given two strings S and T, determine if they are both one edit distance apart.""" def is_one_edit(s, t):    """    :type s: str    :type t: str    :rtype: bool    """    if len(s) > len(t):        return is_one_edit(t, s)    if len(t) - len(s) > 1 or t == s:        return False    for i in range(len(s)):        if s[i] != t[i]:            return s[i+1:] == t[i+1:] or s[i:] == t[i+1:]    return True def is_one_edit2(s, t):    l1, l2 = len(s), len(t)    if l1 > l2:        return is_one_edit2(t, s)    if len(t) - len(s) > 1 or t == s:        return False    for i in range(len(s)):        if s[i] != t[i]:            if l1 == l2:                s = s[:i]+t[i]+s[i+1:]  # modify            else:                s = s[:i]+t[i]+s[i:]  # insertion            break.