Create a program that will take a string ‘s’ and some integer ‘i’ from the user. Then proceed to write an algorithm that will check within the given string ‘s’, the most vowels found within any substring of ‘s’ of given length ‘i’. You may return an integer for the number of vowels found as the output, see examples below for further explanation • For example, if the user inputs the string; s = "iopuuugab" and an integer i = 3, then the output of "3" will be returned as the string "uuu" contains three vowels • Second example: if the user inputs string "gaspesie" and i ="3" then the output returned is "2", the strings "esi" and "sie" both contain 2 vowels (note: the vowels do not need to be consecutive) • Third example: if the user inputs the string "Lynx" and integer = "4", output would be "0" as there are no vowels present. • Fourth example: if the user inputs the string "hello" and integer "2", output would be "1" as the combinations yield only one vowel: "he", "el", "lo"

Read string integer value pairs from input until "Done" is read. For each string read: • If the following integer read is less than 40, output the string followed by ": low on stock". • Otherwise, output the string followed by ": well stocked". End each output with a newline. Ex: If the input is Oven 43 Curtain 7 Pillow 1 Done, then the output is: Oven: well stocked Curtain: low on stock Pillow: low on stock 1 #include 2 #include 3 using namespace std; 4 5 int main() { 6 7 8 9 10 } * Your code goes here */ return 0;

For this project, you will be writing regular expressions that look for and find all instances of a date in any given string. Your program should: Find the following different formats for dates: August 2nd, 1994 august 2, 1994 08/02/1994 08/02/94 08-02-1994 Your program should be case insensitive using re.IGNORECASE Your program can only have a maximum of two different regexes. A special prize goes to those of you who can fit all of this into one regex Your program should be able to tell if the date is a valid date. For example, if the date says 99/99/99, then your program should ignore this as a date. HINT: this is not done within the regex. Try saving your dates to something like a list and going through that list after your regex runs. At the end of your program, it should print out all of the dates in the following format: mm/dd/yyyy. EX. 08/02/1994 Your program should use at least two character classes, you may need more. Feel free to make your own custom classes as well....

Write a program that prompts the user for a month name and a month day. Your program will examine the month and the day to determine the season. Your program will then display the date's season (Winter, Spring, Summer or Autumn). The input is a string to represent the month and an int to represent the day. See chart below for the range of dates within seasons. Ex: If the input is: April 11 the output is: Spring The dates for each season in the northern hemisphere are:Spring: March 20 - June 20Summer: June 21 - September 21Autumn: September 22 - December 20Winter: December 21 - March 19

The method lower() returns a string with all the characters converted to lowercase. True or False

Given 2 strings, return their concatenation, except remove the last character of each and swap the order of the inputted words. The strings will be at least length 3. Ex: If the input is: bird penguin the output is: pengiubir Ex: If the input is: loving csce the output is: csclovin

Design a program with an algorithm that will take a string from the user and then decide if each character in that string is unique. For example, if you ask the user to enter a string and that user enters the world ‘hello’, the result of the algorithm implementedshould return ‘false’ or ‘not unique’. If the user enters a string such as the word ‘phone’ the program will return ‘true’ or ‘unique’ since every character in the word phone is unique and is not repeated. An example of this program follows: Output should show as : enter a string rizma This string has all the unique characters would u like to continue?(y for yes n for no) y Enter a string waali This string is not unique Your code should work for all strings and essentially all characters, as many examples will be tested.

for python programming make a program, that has a function that takes in a string argument and prints a sentence indicating the shortest word in that string. If there is more than one word print only the first. Your print statement should read: "The shortest word is x" Where x = the shortest word. The word should be all uppercase.

Complete the following program that collects an input word from the keyboard and finds if the word is palindrome. A word is palindrome if the sequence of characters are the same from left-to-right and right-to-left, for example, "dad", "racecar" or "rotor" are all palindrome words because they can be read the same either forward or backward. word = input ("Entera word: ") 1s_palindrome = True i = -1 for if word[j] != word[1]: if not is palindrome: else: i-1 is palindrome = False print ("word is palindrome") jin range(len(word)) i+1 -1 print ("word is not palindrome") len(word) jin word

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 <iostream> #include <string> using namespace std; int main() { string inputStr; char inputChar; int strIndex; getline(cin, inputStr); cin >> inputChar; cin >> strIndex; /* Your code goes here */ return 0; }

write a program that inserts parentheses, a space, and a dash into a string of 10 user-entered numbers to format it as a phone number. for example 5555555555 becomes (555) 555-5555. If the user does not enter exactly 10 digits, display an error message. continue to accept user input until the user enters 999 using string builder.