Refine the is_palindrome function to work with arbitrary strings, by ignoring non-letter characters and the distinction between upper- and lowercase letters. For example, if the input string is "Madam, I'm Adam!" then you'd first strip off the last character because it isn't a letter, and recursively check whether the shorter string "Madam, I'm Adam" is a palindrome.

Refine the is_palindrome function to work with arbitrary strings, by ignoring non-letter characters and the distinction between upper- and lowercase letters. For example, if the input string is "Madam, I'm Adam!" then you'd first strip off the last character because it isn't a letter, and recursively check whether the shorter string "Madam, I'm Adam" is a palindrome.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Rewrite the following function, replacing the for loop with a while loop: def myhash(string, maxlen=4): if len(string) > maxlen: return False result = 0 for i in range (len(string)): part_a = 27** (maxlen - i - 1) part_b = 1 + ord(string[i]) - ord('a') result += part_a * part_b %3D return result
Complete the scramble_text() function that takes a single string parameter text. The function returns a new string consisting of the characters in text scrambled order - every pair of characters have their positions swapped. You can assume that the parameter text will have a length of at least 1. For strings with an odd length, the last character remains unchanged in the scrambled text. Some examples of the function being called are shown below. For example: Test text = "I". print (f"{text} --scramble--> {scramble_text (text)}") text = "Hello" print (f"{text} --scramble--> {scramble_text (text)}") text = "superb" print (f"{text} --scramble--> {scramble_text (text)}") Result I --scramble--> I Hello --scramble--> eHllo superb --scramble--> usepbr
code should be python: write a function that allows the input of a list of strings as its only parameter. Inside the body of the function find the first palindromic word and return it. If there is no such word, it should return an empty string. A string is palindromic if it reads the same forward and backward so for example If we call the function with [“horse”, “rat”, “roar”, “dad”, “mom”], the returned value should be “dad”. Note that “mom” is also a palindrome, but it is not the first one.
1. a.Palindromes Complete the function palindrome(String text). Return true if text is a palindrome; if the word is identical forward and backward. Otherwise, return false. Example: palindrome(“racecar”) == true palindrome(“kayaks”) == false See main() for more examples. You can use text.charAt(i) to find the character at index i of text. Use recursion. palindrome() should call itself. No loops allowed. b. Complete the function nestedBrackets(String s). This function should find properly nested brackets within s. Return true if brackets are opened and closed correctly, and false otherwise. Single pairs and nested pairs are valid. For example: z[z]z, [zz[zz]z], [z[[z]zzz]], zzzzz Incorrect pairings and multiple separate pairs are not valid. For example: zz[zz, ]zzz[, [zzz][z], [z[z][z]z] See main() for more examples. nestedBrackets() should call firstIndexOf() and lastIndexOf() to help you solve the problem. Use recursion. nestedBrackets() should call itself. No loops…
‘Write a function nesting(), which takes an arbitrary number of parameters, and returns a list containing the arguments. Write another function unnesting(), which takes a list L as the parameter and retums a 1D list. Notice that, you should be able to use loops to solve thisproblem and should not use recursive functions (which we will not cover in this course). ‘Write assertions to test the two functions.For example nesting(1, nesting(2, 3, nesting(4, 5, [6])), [7, 8], 9)unnesting([1, [2, 3, [4, 5, [6]]], [7. 8], 9]) (1, [2, 3, [4, 5, [6]]], [7, 8], 9][1, 2,3, 4, 5, 6, 7, 8 9]
Write a Python recursive function called contains_vowel that, given a list of strings, returns True if every string in the list contains a vowel, and False otherwise. Here are some example inputs and outputs: ● contains_vowel([“garage”, “this”, “man”]) => True ● contains_vowel([“ffff”, “this”, “man”]) => False ● contains_vowel([]) => False Make sure your function handles any list of strings, and returns the appropriate response. There are no restrictions on the string or list methods that you can use. You may also write any helper functions if you choose. The correctness tests total 24 points. Your function must be recursive in order to keep these correctness points. This means there should not be any loops in your solution.
Python
in python pls
Note: Please Answer in C# language only There is an N of components, represented by the strings S1,S2, .... SN into the kitchen. The chef took all the ingredients, put them in a cauldron and mixed them. In the cauldron, the letters of the strings representing the ingredients are completely shuffled, so that each letter appears in the cauldron as many times as it has appeared in all the strings combined; now the cook can take out one letter from the cauldron at will (if that letter appears in the cauldron more than once, it can be taken out that many times) and use it in a dish. Complete Food is a "chef" chain. Help the chef find the maximum number of complete meals he can make! Input 1 3 Code Chef hacker Output 1
The following requirments that weren't mentioned for solving the following Python Code below: The provided code for alphabet, test_dups, test_miss, and histogram. Your implementation of the has_duplicates function. A loop that outputs duplicate information for each string in test_dups. Your implementation of the missing_letters function. A loop that outputs missing letters for each string in test_miss. Write a function called missing_letters that takes a string parameter and returns a new string with all the letters of the alphabet that are not in the argument string. The letters in the returned string should be in alphabetical order. Your implementation should use a histogram from the histogram function. It should also use the global variable alphabet. It should use this global variable directly, not through an argument or a local copy. It should loop over the letters in alphabet to determine which are missing from the input parameter. The function missing_letters should…
Can this python code be done without using the isdigit() function. Please try to change the following code in the picture so it doesn't use isdigit().
Implement the following function which compares two strings without using the library function. Prototype: int compare(char *str1, char *str2). The compare function returns 0 if str1 is equal to str2, returns 1 if str1 is greater than str2, and returns -1 if str2 is greater than str1. Then print the information in the main function.