c++ program to find the longest radical string. Consider a string containing only letters of the English alphabet, which may contain upper or lowercase characters. A string is considered radical if it contains both the uppercase and lowercase equivalent of a letter. For example “XyYx” would be considered radical since it contains both an uppercase ‘x’ and a lowercase ‘x’, and same for uppercase and lowercase ‘y’. Your function longestRadical will take in a string and return the longest radical substring (assume the user is benevolent and cannot produce an output that will error your code, that is to say worry about only [A...Za...z]) find the longest occurring substring using a divide and conquer approach. If multiple strings would be tied for the longest overall substring length return the later occurring string (relative to the original inputted string).

c++ program to find the longest radical string. Consider a string containing only letters of the English alphabet, which may contain upper or lowercase characters. A string is considered radical if it contains both the uppercase and lowercase equivalent of a letter. For example “XyYx” would be considered radical since it contains both an uppercase ‘x’ and a lowercase ‘x’, and same for uppercase and lowercase ‘y’. Your function longestRadical will take in a string and return the longest radical substring (assume the user is benevolent and cannot produce an output that will error your code, that is to say worry about only [A...Za...z]) find the longest occurring substring using a divide and conquer approach. If multiple strings would be tied for the longest overall substring length return the later occurring string (relative to the original inputted string).

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 8PE: Write a program that reads in a line consisting of a students name, Social Security number, user ID,...

See similar textbooks

Similar questions

Create a function that takes a string with at least one sentence in it and returns a string with the part(s) after the comma at the beginning of the sentence(s). Examples reverse LegoYoda ("Hit you with my stick, I shall.") ➡ "I shall hit you with my stick." reverse LegoYoda ("Rejected me, my crush has. Ketamine, I need.") "My crush has rejected me. I need ketamine." - reverseLegoYoda ("An alien, I am. Holding me captive in Area 51, the government : → "I am an alien. The government is holding me captive in Area 51."
4. Complete the function show_upper. This function takes one parameter - a string (s). It should return a string made up of all the upper-case characters in s. For example, if s is “aBdDEfgHijK” then show_upper should return “BDEHK”. It should return the upper-case string - not print it. Do not change anything outside show_upper.
Write a function that counts the occurrences of a word in a string. Thefunction should return an integer. Do not assume that just one space separates words and a string can contain punctuation. Write the function sothat it works with either a String argument or a StringBuilder object
Write a program that reads in a line consisting of a students name, Social Security number, user ID, and password. The program outputs the string in which all the digits of the Social Security number and all the characters in the password are replaced by x. (The Social Security number is in the form 000-00-0000, and the user ID and the password do not contain any spaces.) Your program should not use the operator [] to access a string element. Use the appropriate functions described in Table 7-1.
In C++, Write a function that receives a string of characters and return true if the string is in language, otherwise it returns false. You may use following function header (Assume a string is in language if it is read from the left side is the same as it is read from the right side. For example, a-b-d-c is not in the language, a-b-c-a-c-b-a is in language): bool isInLanguage_2(string aString) And I also, want to know if my if statement is incorrect, and if it is how is it incorrect?
please code in python Write a function that receives a string and a number (n) as parameters and returns a new string that contains only every nth letter from the given string. print(everyNth('banana', 2)) # should return aaaprint(everyNth('carrot', 3)) # should return rtprint(everyNth('pear', 1)) # should return pear
Scrabble Scrabble is a game where players get points by spelling words. Words are scored by adding together the point values of each individual letter. Define a function scrabble_score (word:str) -> int that takes a string word as input and returns the equivalent scrabble score for that word. score = {"a": 1, "c": 3, "f": 4, "i": 1, "1": 1, "o": 1, "r": 1, "u": 1, "t": 1, "x": 8, "z": 10} For example, "b": 3, "h": 4, "n": 1, Your Answer: == 20 assert scrabble_score("quick") assert scrabble_score("code") == 7 1 # Put your answer here 2 Submit "e": 1, "d": 2, "g": 2, "k": 5, "j": 8, "m": 3, "q": 10, "p": 3, "s": 1, "w": 4, "v": 4, "y": 4,
in c, Writing a program to make the user able to enter text and then enter a letter he wants to remove from this text. I need to write a C function that deletes the desired character in a given character string. Don't use the library function for string operations. * following this finction void letterDeleted(char str[], chardeleted_letter) { }
Write a function secondIndexOf, taking two strings and determining the second occurrence of the second string in the first string. If the search string does not occur twice, -1 should be returned. Example: secondIndexOf('White Rabbit', 'it') should return 10.
Write a C++ program using C-Strings 4. This function returns the index in string s where the substring can first be found. For example if s is “Skyscraper” and substring is “ysc” the function would return 2. It should return -1 if the substring does not appear in the string. int findSubstring(char *s, char substring[]) 5. This function returns true if the argument string is a palindrome. It returns false if it is not. A palindrome is a string that is spelled the same as its reverse. For example “abba” is a palindrome. So is “hannah”, “abc cba”, and “radar”. bool isPalindrome(char *s) Note: do not get confused by white space characters. They should not get any special treatment. “abc ba” is not a palindrome. It is not identical to its reverse. 6) This function should reverse the words in a string. A word can be considered to be any characters, including punctuation, separated by spaces (only spaces, not tabs, \n etc.). So, for example, if s is “The Giants won the Pennant!”…
In C language, Write a function that gets a string containing a positive integer. The function subtracts 1 fromthat integer and puts the obtained value in the string. void str_subtract_one(char* num); For example:- if before we call str_subtract_one(str) we have str==“1997”, then after return str will be “1996”.- if before we call str_subtract_one(str) we have str==“12345678987650”, then after return str will be “12345678987649”.- if before we call str_subtract_one(str) we have str==“100”, then after return str will be “99”. 1. You may assume that the input is always legal, i.e., the string is a positive integer correctly formatted.2. Note that the numbers may be larger than the maximum of int or long. That is, you should not try to convert string to int
Python The function f(s,ch) gets a strings and a character ch. Then it returns a string that is similar to s but does NOT have the character ch. If ch does not appear in s then the result string is equal to s. Example: f('abacadaeafaga', 'a')=='bcdefg' f('abacadaeafaga', 'A')=='abacadaeafaga' Complete the following code for the function f : def f(s, ch): return