Problem Statement Given a two strings s and r, determine if r is within s. Input Input starts with a number N and is followed by N pairs of strings. Output If r is within s, return the index of the first element of r in s return -1 otherwise. Limits 1 <= N <= 20 Notes Problems will have test cases that are not listed in their specification. Your solution must produce the right output for these hidden test cases. Sample Input #1 hello world, world hello world, o wor hello world, wod hello world, llowor Sample Output #1 -1 -1

Problem Statement Given a two strings s and r, determine if r is within s. Input Input starts with a number N and is followed by N pairs of strings. Output If r is within s, return the index of the first element of r in s return -1 otherwise. Limits 1 <= N <= 20 Notes Problems will have test cases that are not listed in their specification. Your solution must produce the right output for these hidden test cases. Sample Input #1 hello world, world hello world, o wor hello world, wod hello world, llowor Sample Output #1 -1 -1

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter6: Modularity Using Functions

Section6.4: A Case Study: Rectangular To Polar Coordinate Conversion

Problem 9E: (Numerical) Write a program that tests the effectiveness of the rand() library function. Start by...

See similar textbooks

Similar questions

C++
IN MAGICFS LANGUAGE The Fibonacci sequence begins like this: 0,1,1,2,3,5,8,13,21,... A number in the sequence is the sum of the previous two numbers in the sequence, with first two being 0 and 1. Implement a function named 'fibonacci' that expects a working value of an integer index, and returns the Fibonacci number at that position in the sequence. The index is zero-based. For instance, if given a value of 4, the function should return 3 because the sequence is 0, 1, 1, 2, 3, ... Use subroutines if necessary. Your answer will be evaluated for partial credit. Comments are encouraged.
In Phython Language: The DNA of a living organism consists of a string of 4 different bases represented with letters A, T, G, C. The DNA has a double helix structure which means these bases are paired in the string. An A base is always paired with a T base molecule and a C base is always paired with G molecule. Write a function matchingPair that accepts a single strand of the DNA structure as a string parameter and produces the pairing strand as a result and returns it. Strings can be considered as list of characters. Therefore the subscript notation that we use for lists is acceptable for strings as well. For example to reach to the 4th character of a string variable mystring, you may use the notation mystring[3]. Write another function search that accepts a long and a short DNA strand as parameters. The function should return the index positions of the occurrences of the short strand in the long strand as a list. Test your functions by accepting a long strand of DNA to find the…
(Numerical) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters to 0, and then generate a large number of pseudorandom integers between 0 and 9. Each time a 0 occurs, increment the variable you have designated as the zero counter; when a 1 occurs, increment the counter variable that’s keeping count of the 1s that occur; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of the time they occurred.
Write a function which takes two integer parameters for values to be added together and returns the result by value. The function may not print anything or read anything directly from the user (i.e. no cin/cout in the function). Assume that the values passed to the function will not be negative, but could be 0 or positive, and will both be integers. The function must implement addition recursively, and cannot use the standalone + operator (only ++) or call any other functions.
uestion 42: Return whether a string consists of a single letter In the function below, return True if the input string parameter consists of a single uppercase letter; otherwise, return False. Most solutions would do this in two logical steps: first testing if the string consists of a single character and, second, testing whether that character is one of the uppercase letters (which can be done by seeing if it is alphabetically between A and Z, inclusive).
The international standard letter/number mapping for telephones is: Write a function that returns a number, given an uppercase letter, as follows:def getNumber(uppercaseLetter):Write a test program that prompts the user to enter a phone number as a string. The input number may contain letters. The program translates a letter (uppercase or lowercase) to a digit and leaves all other characters intact. Here is a sample run of the program: Enter a string: 1-800 flowers1-800-3569377
In C++ Write a recursive function that displays a string reversely on the console using the following header:void reverseDisplay(const string& s) For example, reverseDisplay("abcd") displays dcba. Write a test programthat prompts the user to enter a string and displays its reversal.
Bartleby answered my homework and Write a function called has_duplicates that takes a string parameter and returns True if the string has any repeated characters. Otherwise, it should return False. Implement has_duplicates by creating a histogram using the histogram function above. Do not use any of the implementations of has_duplicates that are given in your textbook. Instead, your implementation should use the counts in the histogram to decide if there are any duplicates. Write a loop over the strings in the provided test_dups list. Print each string in the list and whether or not it has any duplicates based on the return value of has_duplicates for that string. For example, the output for "aaa" and "abc" would be the following. aaa has duplicatesabc has no duplicates Print a line like one of the above for each of the strings in test_dups. True needs to be defined. I tried to code it but didn't accept and got an error message.
2. Write the definition of a bool function named BooleanMode () whose header is bool BooleanMode (bool data[), int n) Given that n represents the size of data, the function returns the truth value that appears the most in data. If there is an equal number of both truth values in data, the function returns the truth value that appeared first. For instance, if data = [true, true,false, false,false, true,falsel, then the function will return false. Impl
Write a function is_mirror(s) that takes as input a string s and returns True if s is a mirrored string (i.e., a string that could have been produced by your mirror function) and False otherwise. Examples:>>> is_mirror('baconnocab')True>>> print(is_mirror('baconnoca'))False
Write it in python