Problem Write a program that captures input from the user. Then, swap the letters two at a time in the string. The first two characters change places, the third and fourth characters change places, etc. Assume that the user will only input strings with an even number of characters. Important, do not put a prompt when asking for user input. Just use input) Adding a prompt will cause your program to not pass the tests. Expected Output If the user inputs home then the output is chem • If the user inputs cars, then the output is act Code Visualizer TRY IT

Problem Write a program that captures input from the user. Then, swap the letters two at a time in the string. The first two characters change places, the third and fourth characters change places, etc. Assume that the user will only input strings with an even number of characters. Important, do not put a prompt when asking for user input. Just use input) Adding a prompt will cause your program to not pass the tests. Expected Output If the user inputs home then the output is chem • If the user inputs cars, then the output is act Code Visualizer TRY IT

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter7: User-defined Simple Data Types, Namespaces, And The String Type

Section: Chapter Questions

Problem 3PE

See similar textbooks

Similar questions

Given a string on one line and an integer number on a second line, add a copy of the last number of characters of the string to the string's end. Then, output the result. Ex: If the input is: Fuzzy bear 4 the output is: Fuzzy bearbear 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 strVar; int substrLen; getline(cin, strVar); cin >> substrLen; /* Your code goes here */ cout << strVar << endl; return 0;}
Write a program which reads string and rewrite it in alphabetical order. For example, the word STRING should be written as GINRST.
Artificial Intelligence- Java program Write code that accomplishes the following tasks. Consider two bags that can hold strings. One bag is named letters and contain seeral one-letter strings. The other bag is empty and is namedvowels. One at a time removed a string from letters. If the string contain a vowel place it into bag vowels, otherwise, discard the string. After you have checked all of the strings in letters, report the number of vowels and the number of times each voewl appears in the bag.
public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string
3. Write a program that transforms numbers 1, 2, 3,..., 12 into the corresponding month names January, February, March, ..., December. Hint: Make a very long string "January February March ...", in which you add spaces such that each month name has the same length. Then use substring to extract the month you want.
Your task is to take 2 strings from the user and then check whether All occurrences of a character of a string must be replaced with another character of another string while preserving the order of characters of strings. Your program just print true or false. Programing language: Java
Removing vowels. Create a program that reads an strings, and produces a new string containing all but the vowels of the input string. Example: forinput "terrific” the output shall be ”trrfc”. Hint: use a loop to iterate over the string and concatenate into an output string variable those characters that are not vowels (“aeiou”)
Let str be a string that contains any number of lower case letters from this set {a, b, c, .. z}. Samples of some valid str's are aabddd, bttttccd, cafffffgggaat etc. Your program must validate the input (check whether it contains only lowercase letters) and create and print a new string (a copy of str) such that all repeated letters in str are replaced by the number of repeats followed by just one letter, i.e., aa will be replaced by 2a, bbb will be replaced by 3b, etc. Other (non-repeated) letters will remain same, For invalid inputs your program must generate an error message. Some sample strings and the expected outputs are as follows. Sample str = aabddd, expected output = 2ab3d Sample str = bttttccd, expected output = b4t2cd Sample str = caffgggaat, expected output = ca2f3g2at
A palindrome is a word or phrase that reads the same forward and backward, ignoring blanks and considering uppercase and lowercase versions of the same letter to be equal. For example, the following are palindromes:warts n strawradarAble was I ere I saw Elbaxyzczyx Write a program that will accept a sequence of characters terminated by a period and will decide whether the string—without the period—is a palindrome. You may assume that the input contains only letters and blanks and is at most 80 characters long. Include a loop that allows the user to check additional strings until she or he requests that the program end. Hint: Define a static method called is Palindrome that begins as follows: /** Precondition: The array a contains letters and blanks in positions a[0] through a[used − 1]. Returns true if the string is a palindrome and false otherwise. */ public static boolean is a palindrome(char[] a int used) Your program should read the input characters into an array whose base…
A word is called ORDERED if all its letters appear in ASCENDING ORDER. Write down a program that will take an English word as input and will determine whether the string is ordered or not. Assume that the word will be entered in all capital letters.
TAKE A LIST OF STRING FROM THE USER AND COUNT THE NUMBER OF UNIQUE ELEMENTS WITHOUT USING THE FOR, WHILE, Do-WHILE LOOPS. PREFERRED PROGRAMMING LANGUAGE: JAVA/C++
Write a program that reads a string and checks the longest substring starting with "a" and ending with "z" included in it. Note that, the substring cannot contain another a or another z in it. For example: Ifs="bcd bbccdd badefgze tabdz", the longest substring is: 6