def is_palindrome_string(string: str) -> bool: """ Given a string , return whether this string is a palindrome string. for ANY CONTINUOUS SEGMENT OF ALPHABETICAL CHARACTERS. That means that "abc;def", has two words: "abc" and "def". The separating character does not have to be whitespace, and there could be more than one separating character between two words. A simple example: given the string "test string test", there are three words, "test", "string", and "test". The first letters of each word come together to form the string "tst". And since "tst" is a palindrome, this function should return True for the input "test string test". Precondition: will contain at least one word. """ " please code this in python and also add this code def is_palindrome(string: str) -> bool: string = string.replace(" ", "") return string.lower() == string[::-1].lower() and use is_palindrome in the main function and also very important please don't use list or import function "

def is_palindrome_string(string: str) -> bool: """ Given a string , return whether this string is a palindrome string. for ANY CONTINUOUS SEGMENT OF ALPHABETICAL CHARACTERS. That means that "abc;def", has two words: "abc" and "def". The separating character does not have to be whitespace, and there could be more than one separating character between two words. A simple example: given the string "test string test", there are three words, "test", "string", and "test". The first letters of each word come together to form the string "tst". And since "tst" is a palindrome, this function should return True for the input "test string test". Precondition: will contain at least one word. """ " please code this in python and also add this code def is_palindrome(string: str) -> bool: string = string.replace(" ", "") return string.lower() == string[::-1].lower() and use is_palindrome in the main function and also very important please don't use list or import function "

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter7: Characters, Strings, And The Stringbuilder

Section: Chapter Questions

Problem 16RQ

See similar textbooks

Similar questions

/*** Adds letterGuessed to the current String updateLetterBoard* @param usedLetterBoard* @param letterGuessed* @param first* @return updateLetterBoard with letterGuess appended. */public static String updateLetterBoard(String usedLetterBoard, char letterGuessed, boolean first) {
}/*** Adds letterGuessed to the current String updateLetterBoard* @param usedLetterBoard* @param letterGuessed* @param first* @return updateLetterBoard with letterGuess appended. */public static String updateLetterBoard(String usedLetterBoard, char letterGuessed, boolean first) {return "";}
Improve the given code below, make sure that the code will require input from the user. Problem: Write a JavaScript function that would accept a string and return the reverse of that string. const reverse = (str) => {const arr = []; //stores character in rev orderconst len = str.length; //finds the length of the stringlet i;for(i = len; i >= 0; i--)arr.push(str[i]); //adds the chars of str to arrreturn arr.join('');} let stringTest, reverseString; //for dummy stringstringTest = "john gabriel";reverseString = reverse(stringTest); console.log("Num3");console.log(`Reverse of the string "${stringTest}" is: "${reverseString}"`);console.log("\n");
Improve the given code below, make sure that the code will require input from the user. Problem: Write a JavaScript function that would accept a string and returns its letters in alphabetical order. function alpha(str){let res;var arr = str.split(""); //splits the strres = arr.sort().join(""); //sorts arr && forms to a strreturn res;}console.log("Num5");console.log(alpha("CSIT201"));
Python Write a function that will redact every third word in a sentence. Make use of the hashtag (#) symbol to redact the characters that make up the word, i.e. if the word is five characters long then a string of five hashtags should replace that word. However, this should not redact any of the following punctuation marks: apostrophes (')quotations (")full stops (.)commas (,)exclamations (!) question marks (?)colons (:)semicolons (;) Arguments: sentence (string) →→\rightarrow sentence that needs to be redacted. Return: redacted sentence (string)→→\rightarrow every third word should be redacted. def redact_words(sentence): return
Task 2: Implement the function Searchingstrings that allow to search a sub-string in a given string and display the: First occurrence, Last occurrence, First occurrence from a given index and Last occurrence from a given index. You can use the following String methods: string. IndexOf(searchvalue, start) return the position of the first occurrence of specified character(s) in a string. string.lastIndexOf(searchvalue, start) return the position of the last occurrence of specified character(s) in a string. You can use the following string to test your solution: var letters = "abcdefghijklmnopqrstuvwxyzabcdefghijklm"; Write the code in a separate.js and separate.html file.
Using just the at, length, and substr string methods and the + (concatenate) operator, write a function that accepts a string s, a start position p, and a length l, and returns a subset of s with the characters starting at position p for a length of l removed. Don’t forget that strings start at position 0. Thus (“abcdefghijk”, 2, 4) returns “abghijk”
The function “reverse” reverses a given string and returns a pointer to the resulting string. Complete the missing parts. char* reverse( char* str ) { int n, h, j, k; char _________________; n = strlen( _____________); h = (n / 2); for ( j=0, k=(n - 1); (j < h); j++, _____________________ ) { tmp = ___________; str[k] = str[j]; str[j] = _______________________________; } return ________________________;} int main( int argc, char** argv ) { char s[512]; strcpy( s, argv[1] ); printf( "Reverse: %s\n", reverse( s ) ); return 0;}
Write a function that when given a URL as a string, parses out just the domain name and returns it as a string. Examples:domain_name("http://github.com/SaadBenn") == "github" domain_name("http://www.zombie-bites.com") == "zombie-bites"domain_name("https://www.cnet.com") == "cnet"Note: The idea is not to use any built-in libraries such as re (regular expression) or urlparse except .split() built-in function""" # Non pythonic waydef domain_name_1(url): #grab only the non http(s) part full_domain_name = url.split('//')[-1] #grab the actual one depending on the len of the list actual_domain = full_domain_name.split('.') # case when www is in the url if (len(actual_domain) > 2): return actual_domain[1] # case when www is not in the url return actual_domain[0] # pythonic one linerdef domain_name_2(url):
PHP Write a matchIPAddress function Write a function matchIPAddress($str) that takes a string representing an IP address as a parameter. The function should return true if the IP address is valid, and false if it is not. An IP address consists of a series of 4 numbers on the range 0-255 separated by dots (e.g. 192.168.0.1). Use regular expressions with capture groups and some additional validation in your solution (e.g. preg_match).]
Question 4 Write a function that will redact every third word in a sentence. Make use of the hashtag (#) symbol to redact the characters that make up the word, i.e. if the word is five characters long then a string of five hashtags should replace that word. However, this should not redact any of the following punctuation marks: apostrophes (') quotations (") full stops (.) commas (,) exclamations (!) question marks (?) colons (:) semicolons (;) Arguments: sentence (string) →→ sentence that needs to be redacted. Return: redacted sentence (string)→→ every third word should be redacted. Expected outputs sentence = "My dear Explorer, do you understand the nature of the given question?" redact_words(sentence) == 'My dear ########, do you ########## the nature ## the given ########?' sentence = "Explorer, this is why you shouldn't come to a test unprepared." redact_words(sentence)=="Explorer, this ## why you #######'# come to # test unprepared."
Create an iterator that returns numbers, starting with 1, and each sequence will increase by one (returning 1,2,3,4,5 etc.):